Shortest path algorithms for knapsack type problems
From MaRDI portal
Publication:4123080
DOI10.1007/BF01580382zbMATH Open0352.90040WikidataQ57401654 ScholiaQ57401654MaRDI QIDQ4123080FDOQ4123080
Authors: Alan Frieze 
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Integer programming (90C10)
Cites Work
- A note on two problems in connexion with graphs
- Some polyhedra related to combinatorial problems
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Title not available (Why is that?)
- 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
Cited In (6)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- 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
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Microcomputer-based algorithms for large scale shortest path problems
This page was built for publication: Shortest path algorithms for knapsack type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123080)
