Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
From MaRDI portal
Publication:4427317
DOI10.1287/ijoc.12.1.2.11900zbMath1052.90048OpenAlexW2105887395MaRDI QIDQ4427317
Nemhauser, George I., Savelsbergh, Martin W. P., Ellis L. Johnson
Publication date: 6 November 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.12.1.2.11900
stochastic integer programmingmixed integer programmingcrew schedulingnetwork designbranch-and-cutbranch-and-pricepreprocessingeffective modelingparallel integer programming
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times, A MILP model for the teacher assignment problem considering teachers' preferences, Finding multiple solutions to general integer linear programs, Theoretical challenges towards cutting-plane selection, On separating cover inequalities for the multidimensional knapsack problem, A branch-and-cut algorithm for the Steiner tree problem with delays, Optimal decision trees for the algorithm selection problem: integer programming based approaches, Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm, Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation, Faster integer-feasibility in mixed-integer linear programs by branching to force change, BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs., An integer programming formulation for a case study in university timetabling., A note on the split rank of intersection cuts, The multidimensional 0-1 knapsack problem: an overview., Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Combining revenue and equity in capacity allocation of imaging facilities, Relations between facets of low- and high-dimensional group problems, New linearizations of quadratic assignment problems, Efficient preprocessing for VLSI optimization problems, Cutting planes in integer and mixed integer programming, Production planning with approved vendor matrices for a hard-disk drive manufacturer, A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound, Cutting plane algorithms for \(0-1\) programming based on cardinality cuts, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach, Efficient solutions for special zero-one programming problems, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Mixed Integer Linear Programming Formulation Techniques, On identifying dominant cliques., Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Challenges in Enterprise Wide Optimization for the Process Industries, Decomposition, reformulation, and diving in university course timetabling, The impact of distribution system characteristics on computational tractability, Mathematical programming models for some smallest-world problems, Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems, Sequence independent lifting for mixed integer programs with variable upper bounds, Flight test data cycle map optimisation, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Uses Software
