Complexity of some parametric integer and network programming problems

JOURNAL ARTICLE published May 1983 in Mathematical Programming

Authors: Patricia J. Carstensen

Some Particular Integer Programming Problems

BOOK CHAPTER published 1991 in Integer Programming

Authors: Stanisław Walukiewicz

Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; NP-complete problems and proof methodology; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: CUTTING PLANE ALGORITHMS

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: John E. Mitchell

Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation: LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: ALGEBRAIC METHODS

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: Rekha R. Thomas

Airline optimization; Alignment problem; Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Graph coloring; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Maximum satisfiability problem; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multidimensional knapsack problems; Multiparametric mixed integer linear programming; Optimization in leveled graphs; Parametric mixed integer nonlinear optimization; Quadratic knapsack; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming: Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem; Vehicle scheduling INTEGER PROGRAMMING

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: Egon Balas

Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: BRANCH AND CUT ALGORITHMS

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: John E. Mitchell

Branch and price: Integer programming with column generation; Convex-simplex algorithm; Decomposition techniques for MILP: Lagrangian relaxation; Equivalence between nonlinear complementarity problem and fixed point problem; Generalized nonlinear complementarity problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Lemke method; Linear complementarity problem; Linear programming; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Order complementarity; Parametric linear programming: Cost simplex algorithm; Parametric mixed integer nonlinear optimization; Principal pivoting methods for linear complementarity problems; Sequential simplex method; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem; Topological methods in complementarity theory INTEGER LINEAR COMPLEMENTARY PROBLEM

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: Panos M. Pardalos | Yasutoshi Yajima

Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Genetic algorithms; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation, Linear programming; Interior point methods; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: BRANCH AND BOUND METHODS

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: Eva K. Lee | John E. Mitchell

Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Lagrange, Joseph-Louis; Lagrangian multipliers methods for convex programming; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multi-objective optimization: Lagrange duality; Multiparametric mixed integer linear programming; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: LAGRANGIAN RELAXATION

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: J. N. Hooker

Parametric Integer Programming

REPORT published 1 January 1975

Authors: Robert M. Nauss

3-valued problem and reduction of some integer programming problems

JOURNAL ARTICLE published 1 January 1991 in Hiroshima Mathematical Journal

Authors: Masahide Ohtomo

Stability of mixed-integer quadratic programming problems

BOOK CHAPTER published 1984 in Sensitivity, Stability and Parametric Analysis

Authors: Bernd Bank | Rainer Hansel

Some related problems from network flows, game theory and integer programming

PROCEEDINGS ARTICLE published October 1972 in 13th Annual Symposium on Switching and Automata Theory (swat 1972)

Authors: Sartaj Sahni

Mixed-Integer Programming

BOOK CHAPTER published 6 May 2021 in Chemical Production Scheduling

Parametric approaches to fractional programs

JOURNAL ARTICLE published October 1983 in Mathematical Programming

Authors: Toshihide Ibaraki

Bilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problem; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Evolutionary algorithms in combinatorial optimization; Fractional programming; Information-based complexity and information-based optimization; Kolmogorov complexity; Mixed integer nonlinear programming; Multi-objective combinatorial optimization; Neural networks for combinatorial optimization; NP-complete problems and proof methodology; Parallel computing: Complexity classes; Quadratic fractional programming: Dinkelbach method; Replicator dynamics in combinatorial optimizationBilevel fractional programming; Combinatorial matrix analysis; Combinatorial optimization algorithms in resource allocation problems; Combinatorial optimization games; Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Evolutionary algorithms in combinatorial optimization; Fractional programming; Information-based complexity and information-based optimization; Kolmogorov complexity; Mixed integer nonlinear programming; Multi-objective combinatorial optimization; NP-complete problems and proof methodology; Parallel computing: Complexity classes; Quadratic fractional programming: Dinkelbach method; Replicator dynamics in combinatorial optimization; Stochastic integer programsFRACTIONAL COMBINATORIAL OPTIMIZATION

BOOK CHAPTER published 2001 in Encyclopedia of Optimization

Authors: Tomasz Radzik

Complexity of linear relaxations in integer programming

JOURNAL ARTICLE published July 2022 in Mathematical Programming

Research funded by Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (185030)

Authors: Gennadiy Averkov | Matthias Schymura

Chapter 7 Some special linear integer models and related problems

BOOK CHAPTER published 22 November 2021 in Linear Integer Programming

Quadratic Integer Programming: Complexity and Equivalent Forms

REFERENCE ENTRY published in SpringerReference

Some Natural Unsolvable Problems

BOOK CHAPTER published 1997 in Computability and Complexity