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

DOI10.1002/NET.3230200306MaRDI QIDQ3479809zbMATHOpenAlexFDO

Authors Monique Guignard, Moshe B. Rosenwein

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

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

Recommendations

• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• A Lagrangian relaxation approach to the generalized minimum spanning tree problem
• A randomly weighted minimum arborescence with a random cost constraint
• A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
• A multiperiod min-sum arborescence problem
• Solving minimum-cost shared arborescence problems

Cites work

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

Cited in

(18)

• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Constrained multi-project planning problems: A Lagrangean decomposition approach
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• A due date assignment algorithm for multiproduct manufacturing facilities
• Modeling and Managing Uncertainty in Process Planning and Scheduling
• A randomly weighted minimum arborescence with a random cost constraint
• scientific article; zbMATH DE number 4053350 (Why is no real title available?)
• Minimum‐weight rooted not‐necessarily‐spanning arborescence problem
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• A randomly weighted minimum spanning tree with a random cost constraint
• The constrained minimum spanning tree problem
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• The return plant location problem: Modelling and resolution
• An homage to Joseph-Louis Lagrange and Pierre Huard
• A constrained Steiner tree problem
• The weighted arborescence constraint

This page was built for publication: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem

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