Discrete Optimization - Volume 5 - Issue 2

The Grothendieck constant of random and pseudo-random graphs

Fulltext Access 5 Pages 2008

εε-optimization schemes and LL-bit precision: Alternative perspectives for solving combinatorial optimization problems

Fulltext Access 12 Pages 2008

Polarity and the complexity of the shooting experiment

Fulltext Access 9 Pages 2008

An improved algorithm for computing Steiner minimal trees in Euclidean dd-space

Fulltext Access 11 Pages 2008

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Fulltext Access 29 Pages 2008

Note on pseudolattices, lattices and submodular linear programs

Fulltext Access 12 Pages 2008

Nonconvex, lower semicontinuous piecewise linear optimization

Fulltext Access 22 Pages 2008

Stochastic scheduling in an in-forest

Fulltext Access 10 Pages 2008

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Fulltext Access 23 Pages 2008

Partition inequalities for capacitated survivable network design based on directed p-cycles

Fulltext Access 19 Pages 2008

Computing robust basestock levels

Fulltext Access 26 Pages 2008

A branch-and-cut approach to the crossing number problem

Fulltext Access 16 Pages 2008

Combined route capacity and route length models for unit demand vehicle routing problems

Fulltext Access 23 Pages 2008

A unified interpretation of several combinatorial dualities

Fulltext Access 13 Pages 2008

A pricing problem under Monge property

Fulltext Access 9 Pages 2008

A Special Issue in Memory of George B. Dantzig

Fulltext Access 6 Pages 2008

The k-path tree matroid and its applications to survivable network design

Fulltext Access 9 Pages 2008

Intermediate integer programming representations using value disjunctions

Fulltext Access 21 Pages 2008

Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities

Fulltext Access 20 Pages 2008

How tight is the corner relaxation?

Fulltext Access 8 Pages 2008

Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes

Fulltext Access 8 Pages 2008

The inverse 1-median problem on a cycle

Fulltext Access 12 Pages 2008

NN-fold integer programming

Fulltext Access 11 Pages 2008

Exploiting planarity in separation routines for the symmetric traveling salesman problem

Fulltext Access 11 Pages 2008

On the p-median polytope of Y-free graphs

Fulltext Access 15 Pages 2008

An algorithmic framework for convex mixed integer nonlinear programs

Fulltext Access 19 Pages 2008

George Dantzig’s impact on the theory of computation

Fulltext Access 12 Pages 2008

George Dantzig’s contributions to integer programming

Fulltext Access 6 Pages 2008

George Dantzig in the development of economic analysis

Fulltext Access 9 Pages 2008

George B. Dantzig and systems optimization

Fulltext Access 8 Pages 2008