Maximal closure on a graph with resource constraints

DOI10.1016/S0305-0548(97)00008-7MaRDI QIDQ1366709zbMATH OpenFDO

Authors Beyime Tachefine, François Soumis

Publication date 16 August 1998

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(97)00008-7

zbMATH Keywords

Lagrangian relaxationmaximal closure on a graphresource constraintssubgradient and bundle methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A New Algorithm for Computing the Maximal Closure of a Graph
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• An algorithm for the resource constrained shortest path problem

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• A New Algorithm for Computing the Maximal Closure of a Graph
• A Selection Problem of Shared Fixed Costs and Network Flows
• An algorithm to generate the ideals of a partial order
• Decomposition Principle for Linear Programs
• scientific article; zbMATH DE number 3846333 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Network flows. Theory, algorithms, and applications.
• Optimizing Field Repair Kits Based on Job Completion Rate
• Selected Applications of Minimum Cuts in Networks
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(1)

• Production phase and ultimate pit limit design under commodity price uncertainty

This page was built for publication: Maximal closure on a graph with resource constraints

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