Shortest path algorithms for knapsack type problems

DOI10.1007/BF01580382MaRDI QIDQ4123080zbMATH OpenWikidataFDO

Authors Alan Frieze

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• A note on two problems in connexion with graphs
• 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
• Multistage Cutting Stock Problems of Two and More Dimensions
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Some polyhedra related to combinatorial problems
• The Theory and Computation of Knapsack Functions

Cited in

(6)

• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• Microcomputer-based algorithms for large scale shortest path problems
• A moment based metric for 2-D and 3-D packing
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Lower bounds on circuit depth of the quantum approximate optimization algorithm

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)