Target-based computer-assisted orchestration: complexity and approximation algorithms

DOI10.1016/j.ejor.2022.05.008OpenAlexW4280537467MaRDI QIDQ2079398

Carmine-Emanuele Cella, Alexandre Teiller, Mila Rocco, Evripidis Bampis, Bruno Escoffier

Publication date: 29 September 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.008

zbMATH Keywords

approximation algorithmscomplexity theorymultistage optimizationautomated orchestration

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Knapsack
• Orchidea
• OrchideaSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multidimensional 0-1 knapsack problem: an overview.
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Dynamic Facility Location via Exponential Clocks
• Changing Bases: Multistage Optimization for Matroids and Matchings
• Facility Location in Evolving Metrics
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Multistage Vertex Cover

This page was built for publication: Target-based computer-assisted orchestration: complexity and approximation algorithms