| Publication | Date of Publication | Type |
|---|
On simultaneous approximation in quadratic integer programming
Operations Research Letters | 2019-07-22 | Paper |
A note on Steiner tree games
Networks | 2012-06-18 | Paper |
Location problems in telecommunications
| 2007-07-23 | Paper |
Threshold based discounting networks: the cost allocation provided by the nucleolus
European Journal of Operational Research | 2005-06-01 | Paper |
Genetic algorithm for network cost minimization using threshold based discounting
Journal of Applied Mathematics and Decision Sciences | 2005-04-05 | Paper |
scientific article; zbMATH DE number 1833130 (Why is no real title available?)
| 2003-03-12 | Paper |
scientific article; zbMATH DE number 1996465 (Why is no real title available?)
| 2003-01-01 | Paper |
scientific article; zbMATH DE number 1841974 (Why is no real title available?)
| 2002-12-04 | Paper |
Network cost minimization using threshold-based discounting
European Journal of Operational Research | 2002-06-16 | Paper |
On delay versus congestion in designing rearrangeable multihop lightware networks
| 2002-01-30 | Paper |
Training artificial neural networks: Backpropagation via nonlinear optimization
Journal of Computing and Information Technology | 2001-11-19 | Paper |
scientific article; zbMATH DE number 761261 (Why is no real title available?)
| 2000-07-06 | Paper |
scientific article; zbMATH DE number 1303789 (Why is no real title available?)
| 1999-09-15 | Paper |
Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
European Journal of Operational Research | 1999-04-22 | Paper |
scientific article; zbMATH DE number 1139465 (Why is no real title available?)
| 1998-04-13 | Paper |
scientific article; zbMATH DE number 970007 (Why is no real title available?)
| 1997-03-11 | Paper |
On minimum congestion routing in rearrangeable multihop lightwave networks
Journal of Heuristics | 1996-09-01 | Paper |
Lower Bounds for the Hub Location Problem
Management Science | 1996-01-07 | Paper |
Extensions of a tabu search adaptation to the quadratic assignment problem
Computers & Operations Research | 1995-05-15 | Paper |
scientific article; zbMATH DE number 714532 (Why is no real title available?)
| 1995-01-23 | Paper |
A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems
Operations Research | 1995-01-12 | Paper |
On tabu search for the location of interacting hub facilities
European Journal of Operational Research | 1994-07-26 | Paper |
Massively parallel tabu search for the quadratic assignment problem
Annals of Operations Research | 1993-08-16 | Paper |
On polynomial solvability of the high multiplicity total weighted tardiness problem
Discrete Applied Mathematics | 1993-05-16 | Paper |
Tabu Search Applied to the Quadratic Assignment Problem
ORSA Journal on Computing | 1993-01-16 | Paper |
A connectionist approach to the quadratic assignment problem
Computers & Operations Research | 1993-01-16 | Paper |
Some proximity and sensitivity results in quadratic integer programming
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Non-linear integer programming: Sensitivity analysis for branch and bound
Operations Research Letters | 1987-01-01 | Paper |
