Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems

DOI10.1007/978-3-319-18008-3_23zbMath1459.90187arXiv1411.5768OpenAlexW1770536317MaRDI QIDQ5741477

Sergey Polyakovskiy, Frank Neumann

Publication date: 25 July 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.5768

zbMATH Keywords

mixed integer programmingNP-hardnessapproximation techniquelinearization techniquenonlinear knapsack problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Ants can orienteer a thief in their robbery ⋮ A weighted-sum method for solving the bi-objective traveling thief problem ⋮ The packing while traveling problem ⋮ Diversity based selection for many-objective evolutionary optimisation problems with constraints ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach ⋮ Efficiently solving the traveling thief problem using hill climbing and simulated annealing

This page was built for publication: Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems