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

DOI10.1002/NET.3230200306zbMATH Open0701.90064OpenAlexW2133044393MaRDI QIDQ3479809FDOQ3479809

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

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

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)

Cites Work

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

Cited In (17)

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

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)