Carlos González-Martín

According to our database, Carlos González-Martín authored at least 14 papers between 2000 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2013

On the second point-to-point undirected shortest simple path problem.

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

Optim. Lett., 2013

2012

An efficient label setting/correcting shortest path algorithm.

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

Comput. Optim. Appl., 2012

2010

On the K shortest path trees problem.

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

Eur. J. Oper. Res., 2010

A new strategy for the undirected two-commodity maximum flow problem.

Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez

Comput. Optim. Appl., 2010

Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study.

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

Asia Pac. J. Oper. Res., 2010

2009

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.

Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín

Eur. J. Oper. Res., 2009

Preemptive benchmarking problem: An approach for official statistics in small areas.

Antonio Sedeño-Noda, Enrique González-Dávila, Carlos González-Martín, Alberto González-Yanes

Eur. J. Oper. Res., 2009

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels.

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

Comput. Optim. Appl., 2009

2006

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.

Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín

Eur. J. Oper. Res., 2006

2005

Solving the undirected minimum cost flow problem with arbitrary costs.

Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez

Networks, 2005

The biobjective undirected two-commodity minimum cost flow problem.

Antonio Sedeño-Noda, Carlos González-Martín, Jose Gutiérrez

Eur. J. Oper. Res., 2005

2004

A generalization of the scaling max-flow algorithm.

Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez

Comput. Oper. Res., 2004

2001

An algorithm for the biobjective integer minimum cost flow problem.

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

Comput. Oper. Res., 2001

2000

The biobjective minimum cost flow problem.

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

Eur. J. Oper. Res., 2000