review article

A PTAS for the Time-Invariant Incremental Knapsack Problem, Combinatorial Optimization

Faenza, Yuri  
•
Malinovic, Igor
July 18, 2018
Lecture Notes in Computer Science
Type
review article
DOI
10.1007/978-3-319-96151-4_14
Author(s)
Faenza, Yuri  
Malinovic, Igor
Date Issued

2018-07-18

Published in
Lecture Notes in Computer Science
Volume

10856

Start page

157

End page

169

Subjects

approximation algorithms disjunctive programming

•

linear programming relaxations time-invariant incremental knapsack

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DISOPT  
Available on Infoscience
November 13, 2018
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/151368