Evolution and state-of-the-art in integer programming
DOI10.1016/S0377-0427(00)00431-3zbMATH Open0966.90054OpenAlexW2054942562MaRDI QIDQ1593833FDOQ1593833
Authors: Hanif D. Sherali, Patrick J. Driscoll 
Publication date: 14 August 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00431-3
Recommendations
- Progress in Academic computational integer programming
- Recent advances in integer programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Integer programming as a framework for optimization and approximability
- An Evolutionary Solver for Pure Integer Linear Programming
- scientific article; zbMATH DE number 1021641
- Developments in linear and integer programming
- Theory and Applications of n-Fold Integer Programming
- scientific article; zbMATH DE number 781263
- An evolutionary algorithm for polishing mixed integer programming solutions
surveyinteger programmingcutting planesbranch-and-cutmeta-heuristicsbranch-and-boundpolyhedral theorystochastic integer programmingfacial disjunctive programmingpost-solution analysisreformulation-linearization techniques
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-and-price: Column generation for solving huge integer programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Title not available (Why is that?)
- Two‐stage stochastic integer programming: a survey
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Title not available (Why is that?)
Cited In (13)
- A linearization framework for unconstrained quadratic (0-1) problems
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Fifty-plus years of combinatorial integer programming
- A method to improve integer linear programming problem with branch-and-bound procedure
- Computing the minimum construction cost of a building's external wall taking into account its energy efficiency
- Future paths for integer programming and links to artificial intelligence
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A partial enumeration algorithm for pure nonlinear integer programming
- Mixed integer programming for a special logic constrained optimal control problem
- An improved partial enumeration algorithm for integer programming problems
- Heuristics for the 0-1 multidimensional knapsack problem
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
- An evolutionary algorithm for polishing mixed integer programming solutions
Uses Software
This page was built for publication: Evolution and state-of-the-art in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593833)
