Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
From MaRDI portal
Publication:1751163
DOI10.1016/j.disopt.2016.05.005zbMath1387.90150OpenAlexW2473765182WikidataQ57736482 ScholiaQ57736482MaRDI QIDQ1751163
Mahdi Doostmohammadi, Agostinho Agra, Cid Carvalho De Souza
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.05.005
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (2)
Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Uses Software
Cites Work
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- A generalization of antiwebs to independence systems and their canonical facets
- An extended formulation approach to the edge-weighted maximal clique problem
- Facets of the independent set polytope
- Conflict graphs in solving integer programming problems
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Conflict analysis in mixed integer programming
- Hybrid heuristics for a short sea inventory routing problem
- A maritime inventory routing problem: Discrete time formulations and valid inequalities
- The Flow Set with Partial Order
- Generating Facets for the Independence System Polytope
- Aggregation and Mixed Integer Rounding to Solve MIPs
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Production Planning by Mixed Integer Programming
- The mixed vertex packing problem.
This page was built for publication: Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph