Decomposition of loosely coupled integer programs: a multiobjective perspective

DOI10.1007/s10107-021-01765-5zbMath1506.90160OpenAlexW4210757054MaRDI QIDQ2097645

Shabbir Ahmed, Natashia Boland, Merve Bodur, Nemhauser, George I.

Publication date: 14 November 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01765-5

zbMATH Keywords

integer programmingcolumn generationmultiobjective integer programmingresource-directive decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (1)

Special issue: Global solution of integer, stochastic and nonconvex optimization problems

Cites Work

• Unnamed Item
• The \(L\)-shape search method for triobjective integer programming
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Branching in branch-and-price: A generic scheme
• Disjunctive programming: Properties of the convex hull of feasible points
• Multicriteria optimization
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• Generalized intersection cuts and a new cut generating paradigm
• Multi-objective integer programming: an improved recursive algorithm
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
• Decomposition Principle for Linear Programs
• Encyclopedia of Optimization
• Lagrangian Relaxation for Integer Programming
• Disjunctive Programming
• Fenchel Cutting Planes for Integer Programs
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Disjunctive Programming
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
• Column Generation
• Decomposition of linear programs by dynamic programming

This page was built for publication: Decomposition of loosely coupled integer programs: a multiobjective perspective