A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
From MaRDI portal
Publication:4018533
DOI10.1057/jors.1992.71zbMath0756.90067OpenAlexW2066554880MaRDI QIDQ4018533
Gabriele C. Sigismondi, Nemhauser, George I.
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.71
Programming involving graphs or networks (90C35) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (54)
An exact algorithm for the maximum stable set problem ⋮ The minimum weighted covering location problem with distance constraints ⋮ An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem ⋮ An Integer Programming Formulation for the Maximum k-Subset Intersection Problem ⋮ Fast separation for the three-index assignment problem ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ Strong lift-and-project cutting planes for the stable set problem ⋮ Polyhedral characterizations and perfection of line graphs ⋮ Solving hard set covering problems ⋮ Strong formulation for the spot 5 daily photograph scheduling problem ⋮ Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms ⋮ Separation problems for the stable set polytope ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Valid Inequalities and Separation Algorithms for the Set Partitioning Problem ⋮ Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation ⋮ Solving VLSI design and DNA sequencing problems using bipartization of graphs ⋮ Polyhedral results for the bipartite induced subgraph problem ⋮ Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. ⋮ Lifting facets of the cut polytope ⋮ A branch and cut solver for the maximum stable set problem ⋮ A column generation and branch-and-cut algorithm for the channel assignment problem ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Faster separation of 1-wheel inequalities by graph products ⋮ Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph ⋮ On the Lovász theta function and some variants ⋮ Polyhedral study of the maximum common induced subgraph problem ⋮ Cutting planes in integer and mixed integer programming ⋮ A branch-and-cut algorithm for graph coloring ⋮ Review of combinatorial problems induced by spatial forest harvesting planning ⋮ A branch-and-cut algorithm for the maximum cardinality stable set problem ⋮ Comparison of column generation models for channel assignment in cellular networks ⋮ An exact approach to the problem of extracting an embedded network matrix ⋮ A branch-and-price approach for the partition coloring problem ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ Optimization algorithms for the disjunctively constrained knapsack problem ⋮ Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem ⋮ Strengthened clique-family inequalities for the stable set polytope ⋮ Facets for node packing ⋮ Unnamed Item ⋮ Strengthening Chvátal-Gomory Cuts for the Stable Set Problem ⋮ Routing trains through a railway station based on a node packing model ⋮ Erratum to ``Comparison of column generation models for channel assignment in cellular networks ⋮ A fast algorithm for the maximum weight clique problem ⋮ The maximum clique problem ⋮ Non delayed relax-and-cut algorithms
This page was built for publication: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
