A survey of exact and approximation algorithms for linear-parametric optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3717343 (Why is no real title available?)
- scientific article; zbMATH DE number 1256704 (Why is no real title available?)
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- scientific article; zbMATH DE number 1512690 (Why is no real title available?)
- scientific article; zbMATH DE number 742963 (Why is no real title available?)
- scientific article; zbMATH DE number 1424289 (Why is no real title available?)
- scientific article; zbMATH DE number 6297748 (Why is no real title available?)
- scientific article; zbMATH DE number 6304483 (Why is no real title available?)
- scientific article; zbMATH DE number 3368644 (Why is no real title available?)
- scientific article; zbMATH DE number 3407703 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A fast parametric assignment algorithm with applications in max-algebra
- A faster parametric minimum-cut algorithm
- A lower bound for the shortest path problem
- A new approach to the maximum-flow problem
- A note on shortest path, assignment, and transportation problems
- A note on the parametric maximum flow problem and some related reoptimization issues
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- A primal-dual simplex algorithm for bi-objective network flow problems
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A sequential algorithm for finding the solution of the parametric minimum flow problem
- A stronger lower bound on parametric minimum spanning trees
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Adjustable robust optimization through multi-parametric programming
- Advances in multiobjective optimisation: scalarisation, approximation, and complexity
- Advances in sensitivity analysis and parametric programming
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for the parametric knapsack problem
- An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
- An alternative method to solve the biobjective minimum cost flow problem
- An approximation algorithm for a general class of multi-parametric optimization problems
- An approximation algorithm for a general class of parametric optimization problems
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- An optimal convex hull algorithm in any fixed dimension
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- An upper bound on the number of planar K-sets
- Applications of Parametric Searching in Geometric Optimization
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximate parametric searching
- Approximating Multiobjective Shortest Path in Practice
- Approximating multiobjective knapsack problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximation algorithms for combinatorial fractional programming problems
- Approximation schemes for the parametric knapsack problem
- Balancing Applied to Maximum Network Flow Problems
- Benson type algorithms for linear vector optimization and applications
- Bicriteria Transportation Problem
- Bicriteria network flow problems: Continuous case
- Bilevel optimization. Advances and next challenges
- Combinatorial Optimization with Rational Objective Functions
- Combinatorial optimization. Networks and matroids
- Complexity of some parametric integer and network programming problems
- Complexity of source-sink monotone 2-parameter min cut
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Computational complexity of parametric linear programming
- Computing maximum mean cuts
- Computing the sequence of \(k\)-cardinality assignments
- Constructing the minimization diagram of a two-parameter problem
- Critical Load Factors in Two-Processor Distributed Systems
- Efficient solutions for the bicriteria network flow problem
- Efficiently constructing convex approximation sets in multiobjective optimization problems
- Enumerating parametric global minimum cuts by random interleaving
- Exact relaxations for parametric robust linear optimization problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Fare evasion in transit networks
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Faster parametric shortest path and minimum‐balance algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Finding the shortest bottleneck edge in a parametric minimum spanning tree
- Generalization of a theorem on the parametric maximum flow problem
- Geometric Duality in Multiple Objective Linear Programming
- Geometric lower bounds for parametric matroid optimization
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- How good is the Chord algorithm?
- Improved bounds for planar k-sets and related problems
- Inner approximation algorithm for solving linear multiobjective optimization problems
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Lower Bounds in a Parallel Model without Bit Operations
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Maximizing concave functions in fixed dimension
- Maximizing non-linear concave functions in fixed dimension
- Multi-level Mixed-Integer Optimization
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- Multicriteria Optimization
- Multiobjective programming and planning
- Multiple objective minimum cost flow problems: a review
- Network flows. Theory, algorithms, and applications.
- Notes on computing peaks in \(k\)-levels and parametric spanning trees
- On the complexity of time-dependent shortest paths
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- On the two-dimensional Davenport-Schinzel problem
- Ordered optimal solutions and parametric minimum cut problems
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- Parametric Combinatorial Computing and a Problem of Program Module Distribution
- Parametric Solution for Linear Bicriteria Knapsack Models
- Parametric and kinetic minimum spanning trees
- Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
- Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming
- Parametric flows in static networks
- Parametric flows, weighted means of cuts, and fractional combinatorial optimization
- Parametric matroid interdiction
- Parametric multiple sequence alignment and phylogeny construction
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- Parametric search made practical
- Parametric shortest path algorithms with an application to cyclic staffing
- Parametric shortest paths in planar graphs
- Parametric stable marriage and minimum cuts
- PolySCIP
- Recent advances in robust optimization: an overview
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Sensitivity analysis of optimal matchings
- Shadows of Newton polytopes
- Slowing down sorting networks to obtain faster sorting algorithms
- Space-sweep algorithms for parametric optimization
- Stability in vector maximization - a survey
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Stochastic spanning tree problem
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Structural and algorithmic properties for parametric minimum cuts
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- The biobjective minimum cost flow problem
- The convergence rate of the sandwich algorithm for approximating convex functions
- The inverse-parametric knapsack problem
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Theoretical and algorithmic advances in multi-parametric programming and control
- Two-phase algorithms for the parametric shortest path problem
- Using Parametric Integer Programming To Plan The Mix Of An Air Transport Fleet
- Using sparsification for parametric minimum spanning tree problems
This page was built for publication: A survey of exact and approximation algorithms for linear-parametric optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921130)
