A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
From MaRDI portal
Publication:4018533
Recommendations
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Node-Packing Problems with Integer Rounding Properties
- Packing Steiner trees: A cutting plane algorithm and computational results
- A faster algorithm for packing branchings in digraphs
- Tree packing and approximating \(k\)-cuts
- Publication:4860272
- Packing cuts in undirected graphs
- The complexity of the node capacitated in-tree packing problem
- A branch and bound algorithm for the strip packing problem
Cited in
(56)- A relax-and-cut algorithm for the set partitioning problem
- Strengthening Chvátal-Gomory cuts for the stable set problem
- An exact algorithm for the maximum stable set problem
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The maximum clique problem
- Strengthened clique-family inequalities for the stable set polytope
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Lifting facets of the cut polytope
- Exact Solution Algorithms for the Chordless Cycle Problem
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
- On the Lovász theta function and some variants
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Review of combinatorial problems induced by spatial forest harvesting planning
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- A branch and cut solver for the maximum stable set problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- scientific article; zbMATH DE number 2230274 (Why is no real title available?)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- Exact methods for the longest induced cycle problem
- Polyhedral characterizations and perfection of line graphs
- A branch-and-price approach for the partition coloring problem
- A fast algorithm for the maximum weight clique problem
- Strong formulation for the spot 5 daily photograph scheduling problem
- A branch-and-cut algorithm for the pallet loading problem
- Optimization algorithms for the disjunctively constrained knapsack problem
- Facets for node packing
- Strong lift-and-project cutting planes for the stable set problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Solving hard set covering problems
- Solving the anti-covering location problem using Lagrangian relaxation
- Separation problems for the stable set polytope
- Polyhedral results for the bipartite induced subgraph problem
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
- A branch-and-cut algorithm for graph coloring
- Fast separation for the three-index assignment problem
- Cutting planes in integer and mixed integer programming
- An exact approach to the problem of extracting an embedded network matrix
- Faster separation of 1-wheel inequalities by graph products
- The stable set problem: clique and nodal inequalities revisited
- Non delayed relax-and-cut algorithms
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
- The minimum weighted covering location problem with distance constraints
- Polyhedral study of the maximum common induced subgraph problem
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- 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
- Comparison of column generation models for channel assignment in cellular networks
- Routing trains through a railway station based on a node packing model
This page was built for publication: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018533)
