| Publication | Date of Publication | Type |
|---|
A heuristic method for the minimum toll booth problem
Journal of Global Optimization | 2010-11-12 | Paper |
| Traffic assignment: equilibrium models | 2008-10-17 | Paper |
| Relaxed toll sets for congestion pricing problems | 2006-10-17 | Paper |
Decomposition techniques for the minimum toll revenue problem
Networks | 2005-01-12 | Paper |
An MPEC approach to second-best toll pricing.
Mathematical Programming. Series A. Series B | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2096643 (Why is no real title available?) | 2004-09-06 | Paper |
Approximate solutions to the turbine balancing problem.
European Journal of Operational Research | 2001-01-01 | Paper |
Continuous Characterizations of the Maximum Clique Problem
Mathematics of Operations Research | 1998-03-29 | Paper |
| scientific article; zbMATH DE number 1488061 (Why is no real title available?) | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 1086905 (Why is no real title available?) | 1997-12-18 | Paper |
| scientific article; zbMATH DE number 956791 (Why is no real title available?) | 1996-12-11 | Paper |
| scientific article; zbMATH DE number 956845 (Why is no real title available?) | 1996-12-11 | Paper |
Minimizing the error bound for the dynamic lot size model
Operations Research Letters | 1996-01-07 | Paper |
A new dynamic programming algorithm for the single item capacitated dynamic lot size model
Journal of Global Optimization | 1995-05-15 | Paper |
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
Journal of Global Optimization | 1995-05-15 | Paper |
| scientific article; zbMATH DE number 578206 (Why is no real title available?) | 1994-05-29 | Paper |
Restricted simplicial decomposition for convex constrained problems
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
Application of the dual active set algorithm to quadratic network optimization
Computational Optimization and Applications | 1993-08-23 | Paper |
Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
American Journal of Mathematical and Management Sciences | 1993-08-17 | Paper |
Benders decomposition for variational inequalities
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Lagrangian dual ascent by generalized linear programming
Operations Research Letters | 1989-01-01 | Paper |
Restricted simplicial decomposition: Computation and extensions
Mathematical Programming Studies | 1987-01-01 | Paper |
Finiteness in restricted simplicial decomposition
Operations Research Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3950170 (Why is no real title available?) | 1984-01-01 | Paper |
Efficient Algorithms for the (Weighted) Minimum Circle Problem
Operations Research | 1982-01-01 | Paper |
The gap function of a convex program
Operations Research Letters | 1982-01-01 | Paper |
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
SIAM Journal on Control and Optimization | 1982-01-01 | Paper |
A subgradient algorithm for certain minimax and minisum problems
Mathematical Programming | 1978-01-01 | Paper |
The minimum sphere covering a convex polyhedron
Naval Research Logistics Quarterly | 1975-01-01 | Paper |
The Minimum Covering Sphere Problem
Management Science | 1972-01-01 | Paper |
