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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2019.05.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2947392384 / rank | |||
Normal rank | |||
Revision as of 20:43, 19 March 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
