 | 2010 |
|---|
| 10 |       | Antonio Sedeño-Noda,
Carlos González-Martín:
Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study.
APJOR 27(6): 677-691 (2010) |
| 9 | | Antonio Sedeño-Noda,
Carlos González-Martín:
On the K shortest path trees problem.
European Journal of Operational Research 202(3): 628-635 (2010) |
| 2009 |
|---|
| 8 | | Antonio Sedeño-Noda,
David Alcaide López de Pablo,
Carlos González-Martín:
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.
European Journal of Operational Research 196(1): 140-154 (2009) |
| 7 | | Antonio Sedeño-Noda,
Enrique González-Dávila,
Carlos González-Martín,
A. González-Yanes:
Preemptive benchmarking problem: An approach for official statistics in small areas.
European Journal of Operational Research 196(1): 360-369 (2009) |
| 2006 |
|---|
| 6 | | Antonio Sedeño-Noda,
David Alcaide López de Pablo,
Carlos González-Martín:
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.
European Journal of Operational Research 174(3): 1501-1518 (2006) |
| 2005 |
|---|
| 5 | | Antonio Sedeño-Noda,
Carlos González-Martín,
Jose Gutiérrez:
The biobjective undirected two-commodity minimum cost flow problem.
European Journal of Operational Research 164(1): 89-103 (2005) |
| 4 | | Antonio Sedeño-Noda,
Carlos González-Martín,
Sergio Alonso:
Solving the undirected minimum cost flow problem with arbitrary costs.
Networks 45(1): 1-3 (2005) |
| 2004 |
|---|
| 3 | | Antonio Sedeño-Noda,
Carlos González-Martín,
Sergio Alonso:
A generalization of the scaling max-flow algorithm.
Computers & OR 31(13): 2183-2198 (2004) |
| 2001 |
|---|
| 2 | | Antonio Sedeño-Noda,
Carlos González-Martín:
An algorithm for the biobjective integer minimum cost flow problem.
Computers & OR 28(2): 139-156 (2001) |
| 2000 |
|---|
| 1 | | Antonio Sedeño-Noda,
Carlos González-Martín:
The biobjective minimum cost flow problem.
European Journal of Operational Research 124(3): 591-600 (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page