The following pages link to G. L. Nemhauser (Q163009):
Displaying 50 items.
- Erratum to: ``An abstract model for branching and its application to mixed integer programming'' (Q1683696) (← links)
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- The sample average approximation method applied to stochastic routing problems: a computational study (Q1866135) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- The fleet assignment problem: Solving a large scale integer program (Q1906074) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
- Column generation for linear and integer programming (Q1946009) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Sequence independent lifting in mixed integer programming (Q1977865) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results (Q2256276) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing (Q2273651) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
- Short-term booking of air cargo space (Q2503264) (← links)
- A generalized permanent label setting algorithm for the shortest path between specified nodes (Q2551743) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
- Decentralized online integer programming problems with a coupling cardinality constraint (Q2669516) (← links)
- Branch-and-price: Column generation for solving huge integer programs (Q2770133) (← links)
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables (Q2775776) (← links)
- Flight string models for aircraft fleeting and routing (Q2783808) (← links)
- Airline crew recovery (Q2783897) (← links)
- An optimization based heuristic for political districting (Q2784017) (← links)
- The fixed-charge shortest-path problem (Q2815469) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- A branch-price-and-cut algorithm for single-product maritime inventory routing (Q2892218) (← links)
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem (Q2899064) (← links)
- A note on ``A superior representation method for piecewise linear functions'' (Q2899082) (← links)
- Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem (Q2899106) (← links)
- Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study (Q2899134) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing (Q2940071) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- Strategic Planning with Start-Time Dependent Variable Costs (Q3100421) (← links)
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions (Q3100469) (← links)
- A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs (Q3105768) (← links)
- Discrete Dynamic Programming and Capital Allocation (Q3115910) (← links)
- Branch-and-Price Guided Search (Q3167607) (← links)
- (Q3204330) (← links)
- (Q3214706) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
