The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (Q2496036): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073233320 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for the biobjective integer minimum cost flow problem / rank | |||
Normal rank | |||
Latest revision as of 17:48, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm |
scientific article |
Statements
The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (English)
0 references
30 June 2006
0 references
minimum cost flow problem
0 references
multiobjective programming
0 references
efficient solution
0 references
