| Publication | Date of Publication | Type |
|---|
Symmetric traveling salesman problems
European Journal of Operational Research | 2018-07-19 | Paper |
On weighting two criteria with a parameter in combinatorial optimization problems
European Journal of Operational Research | 2012-12-29 | Paper |
Solving the rectangular assignment problem and applications
Annals of Operations Research | 2011-04-08 | Paper |
On scheduling a single machine with resource dependent release times
Computers & Operations Research | 2010-12-01 | Paper |
Improved polynomial algorithms for robust bottleneck problems with interval data
Computers & Operations Research | 2009-12-22 | Paper |
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
European Journal of Operational Research | 2009-12-07 | Paper |
On a pair of job-machine assignment problems with two stages
Computers & Operations Research | 2009-10-15 | Paper |
A heuristic for multiple-feeder PCB manufacturing
The Journal of the Operational Research Society | 2009-10-15 | Paper |
Technical Note—A Note on Parametric Analysis in Linear Assignment
Operations Research | 2009-08-13 | Paper |
An addendum on the incremental assignment problem
Information Sciences | 2009-03-24 | Paper |
Partial enumeration in heuristics for some combinatorial optimization problems
The Journal of the Operational Research Society | 2007-06-25 | Paper |
A branch-and-bound algorithm for the singly constrained assignment problem
European Journal of Operational Research | 2006-10-25 | Paper |
Some inverse optimization problems under the Hamming distance
European Journal of Operational Research | 2005-12-05 | Paper |
An addendum on: ``Sensitivity analysis of the optimal assignment
European Journal of Operational Research | 2005-10-17 | Paper |
| scientific article; zbMATH DE number 2130001 (Why is no real title available?) | 2005-01-19 | Paper |
On Steiner versions of (bi)connectivity in network problems
Graphs and Combinatorics | 2004-12-13 | Paper |
Solving the \(k\)-cardinality assignment problem by transformation
European Journal of Operational Research | 2004-08-16 | Paper |
Improved heuristics for the traveling purchaser problem.
Computers & Operations Research | 2004-02-14 | Paper |
Solving group Steiner problems as Steiner problems.
European Journal of Operational Research | 2004-02-02 | Paper |
A note on the assignment problem with seniority and job priority constraints.
European Journal of Operational Research | 2004-02-02 | Paper |
Linear assignment procedures
European Journal of Operational Research | 2002-08-18 | Paper |
Solving some lexicographic multi-objective combinatorial problems
European Journal of Operational Research | 2002-05-28 | Paper |
The dynamic predicate stashing copy problem and the Steiner problem in graphs
European Journal of Operational Research | 2001-09-03 | Paper |
A note on splitting of variables in integer programming models
European Journal of Operational Research | 2000-03-23 | Paper |
Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
Computers & Operations Research | 1999-11-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 |
Well-solved cases of the 2-peripatetic salesman problem
Optimization | 1997-10-23 | Paper |
Linear and semi-assignment problems: A core oriented approach
Computers & Operations Research | 1997-01-06 | Paper |
The edge-disjoing steiner problem in graphs
Optimization | 1996-09-18 | Paper |
| An addendum to the most vital edges of matching in a bipartite graph | 1996-08-05 | Paper |
On the generalized 2-peripatetic salesman problem
European Journal of Operational Research | 1994-07-26 | Paper |
Minimum deviation and balanced optimization: A unified approach
Operations Research Letters | 1991-01-01 | Paper |
An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
The Journal of the Operational Research Society | 1990-01-01 | Paper |
A Lagrangean approach to the degree-constrained minimum spanning tree problem
European Journal of Operational Research | 1989-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 |
| scientific article; zbMATH DE number 4119975 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4127004 (Why is no real title available?) | 1989-01-01 | Paper |
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Computing | 1987-01-01 | Paper |
Some generalizations of the steiner problem in graphs
Networks | 1987-01-01 | Paper |
Better assignment lower bounds for the Euclidean traveling salesman problem
Optimization | 1987-01-01 | Paper |
A note on finding a shortest complete cycle in an undirected graph
European Journal of Operational Research | 1986-01-01 | Paper |
On dual solutions of the linear assignment problem
European Journal of Operational Research | 1985-01-01 | Paper |
Optimal Claiming in an Automobile Insurance System with Bonus-Malus Structure
The Journal of the Operational Research Society | 1985-01-01 | Paper |
Improving Christofides' lower bound for the traveling salesman problem
Optimization | 1985-01-01 | Paper |
Solving symmetric vehicle routing problems asymmetrically
European Journal of Operational Research | 1983-01-01 | Paper |
Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
Operations Research | 1980-01-01 | Paper |
