Antonio Sedeño-Noda Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Alonso, Miguel Ángel Domínguez-Ríos, Marcos Colebrook, Antonio Sedeño-Noda: Optimality conditions in preference-based spanning tree problems. European Journal of Operational Research 198(1): 232-240 (2009)
2008
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJose 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJose 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJose 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntonio 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)

Coauthor Index

1Sergio Alonso [3] [4] [9]
2Marcos Colebrook [2] [7] [8] [9]
3Miguel Ángel Domínguez-Ríos [9]
4Enrique González-Dávila [10]
5Carlos González-Martín [1] [3] [4] [5] [6] [10] [11]
6A. González-Yanes [10]
7Jose Gutiérrez [2] [5] [7] [8]
8D. Alcaide López de Pablo [6] [11]
9Joaquin Sicilia [2] [7] [8]

Copyright © Sun Dec 20 20:26:47 2009 by Michael Ley (ley@uni-trier.de)