| Publication | Date of Publication | Type |
|---|
On weighting two criteria with a parameter in combinatorial optimization problems
European Journal of Operational Research | 2012-12-29 | Paper |
A reduction approach to the repeated assignment problem
European Journal of Operational Research | 2011-04-29 | Paper |
Improved polynomial algorithms for robust bottleneck problems with interval data
Computers & Operations Research | 2009-12-22 | Paper |
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
Computers & Operations Research | 2009-12-22 | Paper |
On a pair of job-machine assignment problems with two stages
Computers & Operations Research | 2009-10-15 | Paper |
The partial inverse minimum spanning tree problem when weight increase is forbidden
European Journal of Operational Research | 2008-02-13 | Paper |
On the complexity of adjacent resource scheduling
Journal of Scheduling | 2007-05-15 | Paper |
Two fast algorithms for all-pairs shortest paths
Computers & Operations Research | 2007-04-13 | Paper |
Looking ahead with the pilot method
Annals of Operations Research | 2006-03-09 | Paper |
Some inverse optimization problems under the Hamming distance
European Journal of Operational Research | 2005-12-05 | Paper |
A branch-checking algorithm for all-pairs shortest paths
Algorithmica | 2005-02-21 | Paper |
On Steiner versions of (bi)connectivity in network problems
Graphs and Combinatorics | 2004-12-13 | Paper |
Solving group Steiner problems as Steiner problems.
European Journal of Operational Research | 2004-02-02 | Paper |
The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
Networks | 2002-01-27 | Paper |
The dynamic predicate stashing copy problem and the Steiner problem in graphs
European Journal of Operational Research | 2001-09-03 | Paper |
scientific article; zbMATH DE number 1424551 (Why is no real title available?)
| 2000-03-23 | Paper |
The partial sum criterion for Steiner trees in graphs and shortest paths
European Journal of Operational Research | 1999-02-22 | Paper |
An addendum to the hierarchical network design problem
European Journal of Operational Research | 1998-10-18 | Paper |
scientific article; zbMATH DE number 1163709 (Why is no real title available?)
| 1998-06-11 | Paper |
Efficient path and vertex exchange in steiner tree algorithms
| 1997-11-25 | Paper |
The edge-disjoing steiner problem in graphs
Optimization | 1996-09-18 | Paper |
The multi-weighted Steiner tree problem
Annals of Operations Research | 1992-06-27 | Paper |
Minimum deviation and balanced optimization: A unified approach
Operations Research Letters | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4152177 (Why is no real title available?)
| 1989-01-01 | Paper |
Reducing the hierarchical network design problem
European Journal of Operational Research | 1989-01-01 | Paper |
An edge elimination test for the Steiner problem in graphs
Operations Research Letters | 1989-01-01 | Paper |
Reduction tests for the steiner problem in grapsh
Networks | 1989-01-01 | Paper |
Some generalizations of the steiner problem in graphs
Networks | 1987-01-01 | Paper |
