How to Pack Your Items When You Have to Buy Your Knapsack

DOI10.1007/978-3-642-40313-2_8zbMath1400.90253OpenAlexW1564661545MaRDI QIDQ2849898

Sebastian Ott, Chien-Chung Huang, Antonios Foivos Antoniadis, José Verschae

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_8

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Throughput maximization in multiprocessor speed-scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Optimizing low dimensional functions over the integers ⋮ Simultaneous selection ⋮ Network-Based Approximate Linear Programming for Discrete Optimization

This page was built for publication: How to Pack Your Items When You Have to Buy Your Knapsack