scientific article; zbMATH DE number 4053350

MaRDI QIDQ3789340zbMATH OpenFDO

Authors Monique Guignard

Publication date 1988

zbMATH Keywords

resource constraintstraveling salesmanLagrangean decompositionminimum weighted arborescence problemfacets of integer polytopes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Recommendations

• Lagrangean decomposition for integer programming : theory and applications
• scientific article; zbMATH DE number 3976783
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme

Cited in

(6)

• scientific article; zbMATH DE number 3976783 (Why is no real title available?)
• An homage to Joseph-Louis Lagrange and Pierre Huard
• Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
• Lagrangian decomposition via sub-problem search
• Lagrangean decomposition for integer programming : theory and applications
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789340)