Generalized dynamic programming methods in integer programming

DOI10.1007/BF01584662zbMath0268.90047MaRDI QIDQ5685859

Laurence A. Wolsey

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (10)

Incorporating processor costs in optimizing the distributed execution of join queries ⋮ The Kth TSP is pseudopolynomial when TSP is polynomial ⋮ A number theoretic reformulation and decomposition method for integer programming ⋮ Optimising the distributed execution of join queries in polynomial time ⋮ Non-standard approaches to integer programming ⋮ Checkerboard pattern: proposals for its generation ⋮ An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem ⋮ 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 ⋮ Optimising the flow of information within a C3I network.

Cites Work

• Unnamed Item
• A Method for the Solution of the N th Best Path Problem
• Constructive Duality in Integer Programming
• 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
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Extensions of the Group Theoretic Approach in Integer Programming

This page was built for publication: Generalized dynamic programming methods in integer programming