# Branch and price

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- INFORMS Journal on Computing
- 2013

The bin packing problem with conflicts consists in packing items in a minimum number of bins of limited capacity while avoiding… (More)

Is this relevant?

2011

2011

- Math. Program.
- 2011

Developing a branching scheme that is compatible with the co lumn generation procedure can be challenging. Application specific… (More)

Is this relevant?

2011

2011

- 2011

In many mixed integer programs there is some embedded problem structure which can be exploited, often by a decomposition. When… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- AAAI
- 2010

Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and… (More)

Is this relevant?

2003

2003

- Computers & OR
- 2003

We describe an algorithmic approach to determine an efficient railway rolling stock circulation on a single line or on a set of… (More)

Is this relevant?

2001

2001

- INFORMS Journal on Computing
- 2001

We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Operations Research
- 2000

We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Operations Research
- 2000

Dantzig-Wolfe decomposition as applied to an integer program is a speci#c form of problem reformulation that aims at providing a… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Operations Research
- 1998

We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Operations Research
- 1997

The generalized assignment problem examines the maximum pro t assignment of jobs to agents such that each job is assigned to… (More)

Is this relevant?