| Publication | Date of Publication | Type |
|---|
A branch‐and‐dive heuristic for single vehicle snow removal
Networks | 2023-11-23 | Paper |
Effect oriented planning of joint attacks
Optimization Theory, Decision Making, and Operations Research Applications | 2017-11-30 | Paper |
Inverse shortest path models based on fundamental cycle bases
Operations Research Proceedings | 2015-03-03 | Paper |
Compatible weights and valid cycles in non-spanning OSPF routing patterns
Algorithmic Operations Research | 2013-12-11 | Paper |
A multicommodity network-flow problem with side constraints on paths solved by column generation
INFORMS Journal on Computing | 2012-05-30 | Paper |
Complexity of inverse shortest path routing
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Optimal placement of UV-based communications relay nodes
Journal of Global Optimization | 2010-11-12 | Paper |
Multiobjective design of survivable IP networks
Annals of Operations Research | 2010-03-23 | Paper |
Optimization of OSPF routing in IP networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Heuristics for the rural postman problem
Computers \& Operations Research | 2009-12-22 | Paper |
Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
JMMA. Journal of Mathematical Modelling and Algorithms | 2009-09-18 | Paper |
Valid cycles: A source of infeasibility in open shortest path first routing
Networks | 2008-12-17 | Paper |
Optimization models for routing in switching networks of Clos type with many stages
| 2008-11-18 | Paper |
On the extremal structure of an OSPF related cone
Vietnam Journal of Mathematics | 2008-07-29 | Paper |
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
European Journal of Operational Research | 2008-02-06 | Paper |
Ring network design
| 2007-07-23 | Paper |
Mean value cross decomposition for nonlinear convex problems
Optimization Methods \& Software | 2006-06-16 | Paper |
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
European Journal of Operational Research | 2004-08-19 | Paper |
Optimization of Internet Protocol network design and routing
Networks | 2004-02-03 | Paper |
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Operations Research | 2002-06-04 | Paper |
Improved empty freight car distribution
Transportation Science | 2002-04-17 | Paper |
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
Operations Research | 2002-02-07 | Paper |
Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
Optimization | 2001-11-06 | Paper |
A production-transportation problem with stochastic demand and concave production costs
Mathematical Programming. Series A. Series B | 2001-03-18 | Paper |
An exact algorithm for the capacitated facility location problems with single sourcing
European Journal of Operational Research | 2000-11-08 | Paper |
Exact solution methods for uncapacitated location problems with convex transportation costs
European Journal of Operational Research | 2000-10-11 | Paper |
scientific article; zbMATH DE number 1487910 (Why is no real title available?)
| 2000-08-10 | Paper |
scientific article; zbMATH DE number 1487908 (Why is no real title available?)
| 2000-08-10 | Paper |
scientific article; zbMATH DE number 1487888 (Why is no real title available?)
| 2000-08-10 | Paper |
Creative modeling: Variable and constraint duplication in primal-dual decomposition methods
Annals of Operations Research | 1999-05-05 | Paper |
scientific article; zbMATH DE number 1264406 (Why is no real title available?)
| 1999-03-16 | Paper |
Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
Location Science | 1999-03-01 | Paper |
Mean value cross decomposition applied to integer programming problems
European Journal of Operational Research | 1999-02-22 | Paper |
A Lagrangean heuristic for the facility location problem with staircase costs
European Journal of Operational Research | 1999-02-22 | Paper |
scientific article; zbMATH DE number 1187081 (Why is no real title available?)
| 1998-08-10 | Paper |
scientific article; zbMATH DE number 1187079 (Why is no real title available?)
| 1998-08-10 | Paper |
scientific article; zbMATH DE number 1187076 (Why is no real title available?)
| 1998-08-10 | Paper |
Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
Operations Research | 1997-06-22 | Paper |
A simple modification of dantzig-wolfe decomposition
Optimization | 1997-02-03 | Paper |
Solving the generalized knapsack problem with variable coefficients
| 1996-12-16 | Paper |
A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
Optimization | 1996-09-18 | Paper |
Efficient decomposition and linearization methods for the stochastic transportation problem
Computational Optimization and Applications | 1996-02-28 | Paper |
Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
Optimization | 1995-08-01 | Paper |
On using approximations of the Benders master problem
European Journal of Operational Research | 1995-04-17 | Paper |
Solving the staircase cost facility location problem with decomposition and piecewise linearization
European Journal of Operational Research | 1995-03-28 | Paper |
A convergence proof for linear mean value cross decomposition
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research | 1994-11-17 | Paper |
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
European Journal of Operational Research | 1993-02-18 | Paper |
On the convergence of cross decomposition
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Cross decomposition applied to the stochastic transportation problem
European Journal of Operational Research | 1984-01-01 | Paper |
