| Publication | Date of Publication | Type |
|---|
Robust discrete spanning tree problem: local search algorithms
Opsearch | 2022-10-18 | Paper |
Identifying defective network components through restricted group testing
Opsearch | 2019-10-18 | Paper |
A diversification operator for genetic algorithms
Opsearch | 2017-01-19 | Paper |
A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
Opsearch | 2017-01-19 | Paper |
Insertion based Lin-Kernighan heuristic for single row facility layout
Computers & Operations Research | 2016-11-11 | Paper |
Data aggregation for \(p\)-median problems
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
European Journal of Operational Research | 2014-07-27 | Paper |
An efficient genetic algorithm for single row facility layout
Optimization Letters | 2014-04-30 | Paper |
The single row facility layout problem: state of the art
Opsearch | 2013-04-12 | Paper |
On homogeneous skewness of unimodal distributions
Sankhyā. Series B | 2010-08-13 | Paper |
Networks in action. Text and computer exercises in network optimization
International Series in Operations Research & Management Science | 2009-12-22 | Paper |
Tolerance-based Algorithms for the Traveling Salesman Problem
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
Tolerance-based branch and bound algorithms for the ATSP
European Journal of Operational Research | 2008-04-24 | Paper |
Iterative patching and the asymmetric traveling salesman problem
Discrete Optimization | 2006-06-30 | Paper |
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
Journal of Global Optimization | 2005-10-18 | Paper |
Sensitivity analysis of a greedy heuristic for knapsack problems
European Journal of Operational Research | 2005-10-17 | Paper |
Data Correcting Algorithms in Combinatorial Optimization
Handbook of Combinatorial Optimization | 2005-09-28 | Paper |
Binary knapsack problems with random budgets
The Journal of the Operational Research Society | 2005-04-04 | Paper |
Branch and peg algorithms for the simple plant location problem
Computers & Operations Research | 2005-02-23 | Paper |
On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems
Applicationes Mathematicae | 2004-11-29 | Paper |
Branch and peg algorithms for the simple plant location problem.
Computers & Operations Research | 2004-02-14 | Paper |
Solving the simple plant location problem using a data correcting approach
Journal of Global Optimization | 2003-10-27 | Paper |
Neighborhood search heuristics for the uncapacitated facility location problem
European Journal of Operational Research | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1848396 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1783857 (Why is no real title available?) | 2002-08-19 | Paper |
A competitive local search heuristic for the subset sum problem
Computers & Operations Research | 1999-09-22 | Paper |
