Ordered optimal solutions and parametric minimum cut problems

DOI10.1016/j.disopt.2005.03.002zbMath1077.90073OpenAlexW1964965825MaRDI QIDQ2568331

Li Liu, Shelby Brumelle, Daniel Granot

Publication date: 10 October 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.03.002

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Total orders (06A05)

Related Items

Theory of Principal Partitions Revisited, A note on the parametric maximum flow problem and some related reoptimization issues, Structural and algorithmic properties for parametric minimum cuts

Cites Work

• Unnamed Item
• The directed subgraph homeomorphism problem
• Linear and combinatorial optimization in ordered algebraic structures
• Generalization of a theorem on the parametric maximum flow problem
• Qualitative Sensitivity Analysis in Monotropic Programming
• Substitutes, Complements and Ripples in Network Flows
• On the structure of all minimum cuts in a network and applications
• Note—Optimal Inventories Based on Job Completion Rate for Repairs Requiring Multiple Items
• Optimizing Field Repair Kits Based on Job Completion Rate
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Critical Load Factors in Two-Processor Distributed Systems
• Minimizing a Submodular Function on a Lattice
• Monotone Comparative Statics
• The Repair Kit Problem Revisited
• A Fast Parametric Maximum Flow Algorithm and Applications
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow