A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.044 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040838688 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The linear ordering problem with cumulative costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the acyclic subgraph polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Facets of the linear ordering polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680289 / rank | |||
Normal rank | |||
Latest revision as of 21:59, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the linear ordering problem with cumulative costs |
scientific article |
Statements
A branch-and-bound algorithm for the linear ordering problem with cumulative costs (English)
0 references
22 April 2008
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
linear ordering problem
0 references
