2009 |
10 | EE | Antonio Sedeño-Noda,
D. 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) |
9 | EE | 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) |
2008 |
8 | EE | Jose Gutiérrez,
Antonio Sedeño-Noda,
Marcos Colebrook,
Joaquin Sicilia:
An efficient approach for solving the lot-sizing problem with time-varying storage capacities.
European Journal of Operational Research 189(3): 682-693 (2008) |
2007 |
7 | EE | Jose Gutiérrez,
Antonio Sedeño-Noda,
Marcos Colebrook,
Joaquin Sicilia:
A polynomial algorithm for the production/ordering planning problem with limited storage.
Computers & OR 34(4): 934-937 (2007) |
2006 |
6 | EE | Antonio Sedeño-Noda,
D. 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 | EE | 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 | EE | 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 | EE | 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) |
2003 |
2 | EE | Jose Gutiérrez,
Antonio Sedeño-Noda,
Marcos Colebrook,
Joaquin Sicilia:
A new characterization for the dynamic lot size problem with bounded inventory.
Computers & OR 30(3): 383-395 (2003) |
2001 |
1 | EE | 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) |