Pages that link to "Item:Q4918254"
From MaRDI portal
The following pages link to A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254):
Displayed 10 items.
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)