#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1994

2018

- This year (2)
- Last 5 years (21)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sanjeeb Dash, Oktay GÃ¼nlÃ¼k
- IPCO
- 2004

In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these inequalities two-stepâ€¦ (More)

- Sanjeeb Dash, Oktay GÃ¼nlÃ¼k, Andrea Lodi
- Math. Program.
- 2010

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describeâ€¦ (More)

- David Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza
- Oper. Res. Lett.
- 2007

The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantageâ€¦ (More)

- David Applegate, William J. Cook, Sanjeeb Dash, AndrÃ© Rohe
- INFORMS Journal on Computing
- 2002

We use a branch-and-cut search to solve the Whizzkidsâ€™96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic frameworkâ€¦ (More)

- Sanjeeb Dash, Oktay GÃ¼nlÃ¼k, Andrea Lodi
- IPCO
- 2007

We study the mixed-integer rounding (MIR) closure of polyhedra. The MIR closure of a polyhedron is equal to its split closure and the associated separation problem is NP-hard. We describe aâ€¦ (More)

- Sanjeeb Dash, Oktay GÃ¼nlÃ¼k
- Math. Program.
- 2008

Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be derived from facets ofâ€¦ (More)

- Sanjeeb Dash, Oktay GÃ¼nlÃ¼k
- Math. Program.
- 2006

We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has recently beenâ€¦ (More)

- Pierre Bonami, GÃ©rard CornuÃ©jols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi
- Math. Program.
- 2008

Recent experiments by Fischetti and Lodi show that the first ChvÃ¡tal closure of a pure Integer Linear Program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimizeâ€¦ (More)

- Sanjeeb Dash
- IPCO
- 2002

- Sanjeeb Dash
- ArXiv
- 2013

McGeoch and Wang (2013) recently obtained optimal or near-optimal solutions to some quadratic unconstrained boolean optimization (QUBO) problem instances using a 439 qubit D-Wave Two quantumâ€¦ (More)