An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem

DOI10.1002/net.3230200306zbMath0701.90064OpenAlexW2133044393MaRDI QIDQ3479809

Moshe B. Rosenwein, Monique Guignard

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200306

zbMATH Keywords

Lagrangean decompositionconstrained resourcehierarchical distribution network designminimum weighted arborescence problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The constrained minimum spanning tree problem, A Randomly Weighted Minimum Arborescence with a Random Cost Constraint, A constrained Steiner tree problem, Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle, Lagrangean decomposition: A model yielding stronger lagrangean bounds, A randomly weighted minimum spanning tree with a random cost constraint, An homage to Joseph-Louis Lagrange and Pierre Huard, Budgeted matching and budgeted matroid intersection via the gasoline puzzle, The weighted arborescence constraint, A due date assignment algorithm for multiproduct manufacturing facilities, Modeling and Managing Uncertainty in Process Planning and Scheduling, An application-oriented guide for designing Lagrangean dual ascent algorithms, The return plant location problem: Modelling and resolution

Cites Work

• An algorithm for the Rural Postman problem on a directed graph