A bound-improving approach to discrete programming problems (Q1340059): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The bound improving sequence algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructive dual methods for discrete programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A revised bound improvement sequence algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved Lagrangean decomposition: An application to the generalized assignment problem / rank | |||
Normal rank | |||
Latest revision as of 09:49, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound-improving approach to discrete programming problems |
scientific article |
Statements
A bound-improving approach to discrete programming problems (English)
0 references
11 December 1994
0 references
Lagrangean duality
0 references
bound-improving sequence
0 references
