Pages that link to "Item:Q4729349"
From MaRDI portal
The following pages link to A Fast Parametric Maximum Flow Algorithm and Applications (Q4729349):
Displaying 50 items.
- A note on balanced flows in equality networks (Q1730034) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Towards equitable distribution via proportional equity constraints (Q1803612) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Strength of a graph and packing of trees and branchings (Q1895050) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- Optimization of computations (Q1905130) (← links)
- 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)
