| Publication | Date of Publication | Type |
|---|
Gerhard J. Woeginger 1964--2022
Internationale Mathematische Nachrichten | 2024-10-22 | Paper |
| A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem | 2024-07-05 | Paper |
| One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs | 2024-06-05 | Paper |
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
| The bipartite travelling salesman problem: A pyramidally solvable case | 2023-02-10 | Paper |
Minimum cost dynamic flows: the series-parallel case
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
| 2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics | 2022-03-11 | Paper |
The constant objective value property for multidimensional assignment problems
Discrete Optimization | 2018-05-24 | Paper |
Geometric versions of the three-dimensional assignment problem under general norms
Discrete Optimization | 2018-05-24 | Paper |
| 2VRP: a benchmark problem for small but rich VRPs | 2018-02-22 | Paper |
Four-point conditions for the TSP: the complete complexity classification
Discrete Optimization | 2015-04-09 | Paper |
| The constant objective value property for combinatorial optimization problems | 2014-05-19 | Paper |
Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
Operations Research Letters | 2014-05-15 | Paper |
The Northwest corner rule revisited
Discrete Applied Mathematics | 2011-08-10 | Paper |
ILP models for a nurse scheduling problem
Operations Research Proceedings | 2011-04-07 | Paper |
A fast parametric assignment algorithm with applications in max-algebra
Networks | 2010-11-24 | Paper |
Four point conditions and exponential neighborhoods for symmetric TSP
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The computational complexity of bilevel assignment problems
4OR | 2010-06-16 | Paper |
Polygons with inscribed circles and prescribed side lengths
Applied Mathematics Letters | 2009-06-09 | Paper |
The complexity of computing the Muirhead-Dalton distance
Mathematical Social Sciences | 2009-04-20 | Paper |
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters | 2006-06-30 | Paper |
Faster algorithms for computing power indices in weighted voting games
Mathematical Social Sciences | 2005-06-01 | Paper |
Minimum-cost dynamic flows: The series-parallel case
Networks | 2004-08-04 | Paper |
Which matrices are immune against the transportation paradox?
Discrete Applied Mathematics | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1786145 (Why is no real title available?) | 2003-01-30 | Paper |
| Minimum-cost strong network orientation problems: Classification, complexity, and algorithms | 2002-07-21 | Paper |
A note on the complexity of the transportation problem with a permutable demand vector
Mathematical Methods of Operations Research | 2001-09-03 | Paper |
Bottleneck capacity expansion problems with general budget constraints
RAIRO. Operations Research | 2001-01-01 | Paper |
Bottleneck capacity expansion problems with general budget constraints
RAIRO. Operations Research | 2001-01-01 | Paper |
Bottleneck capacity expansion problems with general budget constraints
RAIRO. Operations Research | 2001-01-01 | Paper |
A process scheduling problem arising from chemical production planning
Optimization Methods & Software | 2000-06-04 | Paper |
The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
Computers & Mathematics with Applications | 1999-11-08 | Paper |
The Steiner tree problem in Kalmanson matrices and in circulant matrices
Journal of Combinatorial Optimization | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1310280 (Why is no real title available?) | 1999-06-29 | Paper |
One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
Operations Research Letters | 1998-12-06 | Paper |
| scientific article; zbMATH DE number 1163111 (Why is no real title available?) | 1998-06-11 | Paper |
The computational complexity of Steiner tree problems in graded matrices
Applied Mathematics Letters | 1997-12-09 | Paper |
Perspectives of Monge properties in optimization
Discrete Applied Mathematics | 1996-10-09 | Paper |
On the recognition of permuted bottleneck Monge matrices
Discrete Applied Mathematics | 1996-07-04 | Paper |
Permuting matrices to avoid forbidden submatrices
Discrete Applied Mathematics | 1996-04-23 | Paper |
| scientific article; zbMATH DE number 714530 (Why is no real title available?) | 1995-01-23 | Paper |
The quickest flow problem
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1993-05-03 | Paper |
