#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2000

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Antonio Sedeño-Noda, Carlos González-Martín
- Computers & OR
- 2001

- Antonio Sedeño-Noda, Carlos González-Martín
- European Journal of Operational Research
- 2010

We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m)… (More)

- Antonio Sedeño-Noda, Carlos González-Martín
- European Journal of Operational Research
- 2000

- Antonio Sedeño-Noda, Carlos González-Martín
- Comp. Opt. and Appl.
- 2009

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to enter into the basis simultaneously. We call to this operation multiple pivot. We show that a shortest path simplex algorithm with this pivot rule makes O(n) multiple pivots and runs in O(nm) time. This new pivot… (More)

- Antonio Sedeño-Noda, Carlos González-Martín
- APJOR
- 2010

This paper introduces a new shortest path simplex pivot rule choosing a subset of non-basic arcs to simultaneously enter into the basis. The term multiple pivot for this operation is used. From this concept, a generic shortest path simplex algorithm with multiple pivots is described. In addition, a simplex multiple pivot rule is provided to design a… (More)

- Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín
- European Journal of Operational Research
- 2006

This paper deals with pre-emptive open-shop scheduling problems with time-windows. Network flow procedures to check feasibility and a max-flow parametrical algorithm to minimize the makespan are introduced. Also, computational complexities are evaluated for these feasibility and optimization algorithms. The proposed method is a strongly polynomial algorithm… (More)

- Antonio Sedeño-Noda, Enrique González-Dávila, Carlos González-Martín, A. González-Yanes
- European Journal of Operational Research
- 2009

- Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín
- European Journal of Operational Research
- 2009

- Antonio Sedeño-Noda, Carlos González-Martín
- Comp. Opt. and Appl.
- 2012

We design a new label shortest path algorithm by applying the concept of a pseudo permanent label. This approach allows an algorithm to partition the set of nodes into two new sets: pseudo permanently labeled nodes and its complementary set. From this point of view, this new label method can be considered as label setting and is also a Dijkstra (1959)… (More)

- Antonio Sedeño-Noda, Carlos González-Martín, Jose Gutiérrez
- European Journal of Operational Research
- 2005

We address the two-commodity minimum cost flow problem considering two objectives. We show that the biobjective undirected two-commodity minimum cost flow problem can be split into two standard biobjective minimum cost flow problems using the change of variables approach. This technique allows us to develop a method that finds all the efficient extreme… (More)