Maximal closure on a graph with resource constraints

DOI10.1016/S0305-0548(97)00008-7zbMath0893.90168MaRDI QIDQ1366709

Beyime Tachefine, François Soumis

Publication date: 16 August 1998

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

zbMATH Keywords

Lagrangian relaxationresource constraintsmaximal closure on a graphsubgradient and bundle methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Production phase and ultimate pit limit design under commodity price uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to generate the ideals of a partial order
• Decomposition Principle for Linear Programs
• The Cutting-Plane Method for Solving Convex Programs
• A New Algorithm for Computing the Maximal Closure of a Graph
• Selected Applications of Minimum Cuts in Networks
• Optimizing Field Repair Kits Based on Job Completion Rate
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• A Fast Parametric Maximum Flow Algorithm and Applications
• A Selection Problem of Shared Fixed Costs and Network Flows

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