Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
From MaRDI portal
Publication:1278590
DOI10.1016/0377-2217(95)00373-8zbMath0923.90121OpenAlexW2109445739WikidataQ128082025 ScholiaQ128082025MaRDI QIDQ1278590
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00373-8
Related Items
An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, Constrained integer fractional programming problem with box constraints, Using the analytic center in the feasibility pump, A framework for solving mixed-integer semidefinite programs, Polynomial Interior Point Cutting Plane Methods, Cuts for mixed 0-1 conic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- Solution of large-scale symmetric travelling salesman problems
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A parallel interior point method and its application to facility location problems
- An implementation of Karmarkar's algorithm for linear programming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Gomory cuts revisited
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Fenchel Cutting Planes for Integer Programs
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
