A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q188435 |
Changed an Item |
||
| Property / author | |||
| Property / author: Roberto Wolfler Calvo / rank | |||
Normal rank | |||
Revision as of 09:41, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints |
scientific article |
Statements
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (English)
0 references
28 November 2019
0 references
dual ascent heuristic
0 references
Lagrangian relaxation
0 references
subgradient method
0 references
generalized set partitioning
0 references
