Branch-and-cut for linear programs with overlapping SOS1 constraints
From MaRDI portal
Recommendations
- On the structure of linear programs with overlapping cardinality constraints
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Branch-and-cut for complementarity and cardinality constrained linear programs
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Implementations of special ordered sets in MP software
Cites work
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- A note on greedy algorithms for the maximum weighted independent set problem
- A polyhedral study of the cardinality constrained knapsack problem
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
- Algorithm 457: finding all cliques of an undirected graph
- An approximation scheme for bin packing with conflicts
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Branch-and-cut for complementarity-constrained optimization
- Branching rules revisited
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Cutting-planes for programs with disjunctive constraints
- Facets of the Complementarity Knapsack Polytope
- Future paths for integer programming and links to artificial intelligence
- Heuristics for convex mixed integer nonlinear programs
- Implementations of special ordered sets in MP software
- Measuring the impact of primal heuristics
- Mutual exclusion scheduling
- New branch-and-Cut algorithm for bilevel linear programming
- Nurse scheduling with tabu search and strategic oscillation
- On linear programs with linear complementarity constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- Representability in mixed integer programming. I: Characterization results
- SCIP: solving constraint integer programs
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- The Knapsack Problem with Conflict Graphs
- The capacity of wireless networks
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The mixed vertex packing problem.
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Transportation problem with nonlinear side constraints a branch and bound approach
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
Cited in
(10)- New classes of facets for complementarity knapsack problems
- An enhanced logical benders approach for linear programs with complementarity constraints
- Recovery under side constraints
- Cardinality minimization, constraints, and regularization: a survey
- Relaxations and cutting planes for linear programs with complementarity constraints
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- On the structure of linear programs with overlapping cardinality constraints
- New classes of facets for complementarity knapsack problems
- Solving linear programs with complementarity constraints using branch-and-cut
This page was built for publication: Branch-and-cut for linear programs with overlapping SOS1 constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646682)
