scientific article
From MaRDI portal
zbMATH Open0645.90058MaRDI QIDQ3789340FDOQ3789340
Publication date: 1988
Title of this publication is not available (Why is that?)
resource constraintstraveling salesmanLagrangean decompositionminimum weighted arborescence problemfacets of integer polytopes
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)
Cited In (2)
Recommendations
- Lagrangean decomposition for integer programming : theory and applications π π
- Title not available (Why is that?) π π
- 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 π π
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)