A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One

DOI10.1287/opre.1120.1093zbMath1267.90124OpenAlexW2167597350MaRDI QIDQ5301134

Shashi Mittal, Andreas S. Schulz

Publication date: 2 July 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1120.1093

zbMATH Keywords

combinatorial optimizationanalysis of algorithmsproduction/scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (20)

Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model ⋮ Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model ⋮ Fractional 0-1 programming and submodularity ⋮ Technical Note—Capacitated Assortment Optimization: Hardness and Approximation ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Assortment optimization with position effects under the nested logit model ⋮ Data‐driven research in retail operations—A review ⋮ Approximation Algorithms for Product Framing and Pricing ⋮ Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ On upper bounds for assortment optimization under the mixture of multinomial logit models ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Capacitated assortment and price optimization under the multilevel nested logit model ⋮ Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings ⋮ A PTAS for a class of binary non-linear programs with low-rank functions ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ Capacitated assortment and price optimization under the nested logit model ⋮ Strongly polynomial FPTASes for monotone dynamic programs ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier

This page was built for publication: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One