Pages that link to "Item:Q5717716"

The following pages link to A branch-and-price approach for the maximum weight independent set problem (Q5717716):

Displaying 11 items.

• A branch and cut solver for the maximum stable set problem (Q491210) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
• A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
• A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)