A bound-improving approach to discrete programming problems

DOI10.1007/BF01581146MaRDI QIDQ1340059zbMATH OpenFDO

Authors V. Pereyra

Publication date 11 December 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Lagrangean dualitybound-improving sequence

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3922375
• scientific article; zbMATH DE number 3936927
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Discrete approximation of a problem of continuous programming
• An improved bounding procedure for the constrained assignment problem
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• scientific article; zbMATH DE number 3978825
• scientific article; zbMATH DE number 617944
• scientific article; zbMATH DE number 4167852
• Algorithms for solving a separable problem of discrete optimization

Cites work

• A revised bound improvement sequence algorithm
• Constructive dual methods for discrete programming
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• The bound improving sequence algorithm

Cited in

(5)

• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
• scientific article; zbMATH DE number 63645 (Why is no real title available?)
• The bound improving sequence algorithm
• Constructive dual methods for discrete programming
• A Dynamic Programming Solution to Bounded Dejittering Problems

This page was built for publication: A bound-improving approach to discrete programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340059)