The following pages link to Nemhauser, George I. (Q163009):
Displaying 50 items.
- (Q201776) (redirect page) (← links)
- (Q217068) (redirect page) (← links)
- (Q339713) (redirect page) (← links)
- Pricing for production and delivery flexibility in single-item lot-sizing (Q339714) (← links)
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- The value function of an infinite-horizon single-item lot-sizing problem (Q433828) (← links)
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- A branch-and-price guided search approach to maritime inventory routing (Q502460) (← links)
- Hooked on IP (Q537605) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- (Q586307) (redirect page) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- Improving airline operational performance through schedule perturbation (Q867534) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- An optimization approach for planning daily drayage operations (Q926343) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Branch-and-bound and parallel computation: A historical note (Q1099088) (← links)
- An application of vertex packing to data analysis in the evaluation of pavement deterioration (Q1165769) (← links)
- R-domination of block graphs (Q1171499) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- Min-cut clustering (Q1321669) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- MINTO, a Mixed INTeger Optimizer (Q1331882) (← links)
- Some properties of the fleet assignment problem (Q1332950) (← links)
- The aircraft rotation problem (Q1357767) (← links)
- Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
- A polyhedral study of the cardinality constrained knapsack problem (Q1404231) (← links)
- On the polyhedral structure of a multi-item production planning model with setup times (Q1411623) (← links)
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case (Q1411630) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting (Q1424282) (← links)
- Models for representing piecewise linear cost functions (Q1433660) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
- A parallel primal-dual simplex algorithm (Q1591540) (← links)
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744) (← links)
- A parallel local search framework for the fixed-charge multicommodity network flow problem (Q1652019) (← links)
- Flexible solutions to maritime inventory routing problems with delivery time windows (Q1652459) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
