Decomposition of loosely coupled integer programs: a multiobjective perspective
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4106629
- A decomposition technique for mixed integer programming problems
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Decomposition and coordination for many-objective optimization
- Lagrangean decomposition for integer programming : theory and applications
- Decomposition for solutions of large-scale multicriteria problems
- Multiobjective linear and integer programming
- Reformulation and decomposition of integer programs
- Interactive Coordination of Objective Decompositions in Multiobjective Programming
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branch-and-price: Column generation for solving huge integer programs
- Branching in branch-and-price: A generic scheme
- Column Generation
- Decomposition Principle for Linear Programs
- Decomposition of linear programs by dynamic programming
- Disjunctive Programming
- Disjunctive programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Encyclopedia of Optimization
- Fenchel Cutting Planes for Integer Programs
- Generalized intersection cuts and a new cut generating paradigm
- Lagrangian relaxation for integer programming
- Multi-objective integer programming: an improved recursive algorithm
- Multicriteria optimization
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- On a level-set characterization of the value function of an integer program and its application to stochastic programming
- The \(L\)-shape search method for triobjective integer programming
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
Cited in
(3)
This page was built for publication: Decomposition of loosely coupled integer programs: a multiobjective perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097645)
