A branch-and-price approach for the maximum weight independent set problem
From MaRDI portal
Publication:5717716
DOI10.1002/net.20088zbMath1093.90089OpenAlexW4243118528MaRDI QIDQ5717716
Wilbert E. Wilhelm, Deepak Warrier, Illya V. Hicks, Jeffrey S. Warren
Publication date: 10 January 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20088
Dantzig-Wolfe decompositionbranch and pricevertex partitioninginheritly decomposable graphsmaximum weight-independent set problem
Related Items
A Lagrangean decomposition for the maximum independent set problem applied to map labeling, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, A branch and cut solver for the maximum stable set problem, A hybrid iterated local search heuristic for the maximum weight independent set problem, The generalized independent set problem: polyhedral analysis and solution approaches, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, A tutorial on branch and cut algorithms for the maximum stable set problem, A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, Lagrangean decompositions for the unconstrained binary quadratic programming problem
Uses Software
Cites Work
