Pages that link to "Item:Q4729349"
From MaRDI portal
The following pages link to A Fast Parametric Maximum Flow Algorithm and Applications (Q4729349):
Displayed 50 items.
- Minimum cuts in parametric networks (Q1905228) (← links)
- Integral packing of trees and branchings (Q1907770) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Branch-and-mincut: global optimization for image segmentation with high-level priors (Q1932989) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- HNCcorr: combinatorial optimization for neuron identification (Q2158640) (← links)
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Estimating piecewise monotone signals (Q2180071) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- Computer science and decision theory (Q2271874) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- Parametric power supply networks (Q2354290) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Preemptive benchmarking problem: An approach for official statistics in small areas (Q2378486) (← links)
- Image restoration with discrete constrained total variation. I: Fast and exact optimization (Q2384085) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Polynomiality of sparsest cuts with fixed number of sources (Q2467444) (← links)
- A note on the parametric maximum flow problem and some related reoptimization issues (Q2480211) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- A survey on models and algorithms for discrete evacuation planning network problems (Q2514655) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- Network reinforcement (Q2583121) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
- Total Variation in Imaging (Q2789827) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- Summary and Semi-average Similarity Criteria for Individual Clusters (Q2820112) (← links)
- (Q2882852) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- A fast parametric assignment algorithm with applications in max-algebra (Q3057132) (← links)