Ordered optimal solutions and parametric minimum cut problems
From MaRDI portal
Recommendations
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Structural and algorithmic properties for parametric minimum cuts
- On minimum cuts and the linear arrangement problem
- Approximation algorithms for minimum norm and ordered optimization problems
- Optimal ordered problem solver
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Well-posed minimum problems for preorders
- An optimality cut for mixed integer linear programs
- scientific article; zbMATH DE number 176254
- scientific article; zbMATH DE number 4033534
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- Critical Load Factors in Two-Processor Distributed Systems
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Generalization of a theorem on the parametric maximum flow problem
- scientific article; zbMATH DE number 913348 (Why is no real title available?)
- Linear and combinatorial optimization in ordered algebraic structures
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Minimizing a Submodular Function on a Lattice
- Monotone Comparative Statics
- Note—Optimal Inventories Based on Job Completion Rate for Repairs Requiring Multiple Items
- On the structure of all minimum cuts in a network and applications
- Optimizing Field Repair Kits Based on Job Completion Rate
- Qualitative sensitivity analysis in monotropic programming
- Substitutes, Complements and Ripples in Network Flows
- The directed subgraph homeomorphism problem
- The Repair Kit Problem Revisited
Cited in
(4)
This page was built for publication: Ordered optimal solutions and parametric minimum cut problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568331)