Generalized dynamic programming methods in integer programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- A Method for the Solution of the N th Best Path Problem
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- An Adaptive Group Theoretic Algorithm for Integer Programming Problems
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Constructive Duality in Integer Programming
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Extensions of the Group Theoretic Approach in Integer Programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Relaxation Methods for Pure and Mixed Integer Programming Problems
Cited in
(10)- Optimising the flow of information within a C3I network.
- A number theoretic reformulation and decomposition method for integer programming
- Non-standard approaches to integer programming
- Optimising the distributed execution of join queries in polynomial time
- The Kth TSP is pseudopolynomial when TSP is polynomial
- Checkerboard pattern: proposals for its generation
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
- Evaluating multiple join queries in a distributed database system
- Incorporating processor costs in optimizing the distributed execution of join queries
- An algorithm for determining the k-best solutions of the one-dimensional knapsack problem
This page was built for publication: Generalized dynamic programming methods in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685859)
