Pages that link to "Item:Q4018533"
From MaRDI portal
The following pages link to A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533):
Displayed 26 items.
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- Facets for node packing (Q1278997) (← links)
- A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Review of combinatorial problems induced by spatial forest harvesting planning (Q2489911) (← links)
- (Q5708566) (← links)
- A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)