Shortest path algorithms for knapsack type problems
From MaRDI portal
Publication:4123080
DOI10.1007/BF01580382zbMath0352.90040WikidataQ57401654 ScholiaQ57401654MaRDI QIDQ4123080
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C30: Nonlinear programming
Related Items
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, Microcomputer-based algorithms for large scale shortest path problems, A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs, A moment based metric for 2-D and 3-D packing, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Lower bounds on circuit depth of the quantum approximate optimization algorithm
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Some polyhedra related to combinatorial problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
- The Theory and Computation of Knapsack Functions