Pages that link to "Item:Q4018533"

The following pages link to A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533):

Displaying 50 items.

• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
• A branch and cut solver for the maximum stable set problem (Q491210) (← links)
• Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
• Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
• Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← 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)
• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
• On the Lovász theta function and some variants (Q1751239) (← links)
• Polyhedral study of the maximum common induced subgraph problem (Q1761750) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
• Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
• Solving hard set covering problems (Q1924619) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
• A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← 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)
• Fast separation for the three-index assignment problem (Q2398106) (← 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)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
• Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation (Q2962548) (← links)
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Separation problems for the stable set polytope (Q5101406) (← links)
• Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
• (Q5708566) (← links)
• A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)