| Publication | Date of Publication | Type |
|---|
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Discrete Optimization | 2018-08-17 | Paper |
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Information Processing Letters | 2016-06-09 | Paper |
An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme
Information Processing Letters | 2016-06-01 | Paper |
Trioid: a generalization of matroid and the associated polytope
Algorithmic Operations Research | 2013-12-11 | Paper |
2-commodity integer network synthesis problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Infeasibility analysis for linear systems, a survey
The Arabian Journal for Science and Engineering. Section C: Theme Issues | 2013-09-11 | Paper |
Spanning cactus of a graph: Existence, extension, optimization, and approximation
Discrete Applied Mathematics | 2012-11-22 | Paper |
The minimum spanning tree problem with conflict constraints and its variations
Discrete Optimization | 2012-06-20 | Paper |
An \(O(n^{4})\) algorithm for the QAP linearization problem
Mathematics of Operations Research | 2012-05-24 | Paper |
Integer exact network synthesis problem
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Integer version of the multipath flow network synthesis problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
A strongly polynomial simplex method for the linear fractional assignment problem
Operations Research Letters | 2009-03-04 | Paper |
Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
VLSN search algorithms for partitioning problems using matching neighbourhoods
The Journal of the Operational Research Society | 2008-07-29 | Paper |
Geometric problems in automated manufacturing.
Opsearch | 2008-01-25 | Paper |
On cost matrices with two and three distinct values of Hamiltonian paths and cycles
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
Flows over edge-disjoint mixed multipaths and applications
Discrete Applied Mathematics | 2007-09-19 | Paper |
Some necessary conditions and a general sufficiency condition for the validity of a Gilmore-Gomory type patching scheme for the traveling salesman problem
| 2007-08-13 | Paper |
On-line network synthesis
| 2007-08-13 | Paper |
An improved algorithm for decomposing arc flows into multipath flows
Operations Research Letters | 2006-01-18 | Paper |
Multiroute flows: cut-trees and realizability
Discrete Optimization | 2006-01-09 | Paper |
Multi-terminal multipath flows: synthesis
Discrete Applied Mathematics | 2004-11-23 | Paper |
Fuzzy disk for covering fuzzy points
European Journal of Operational Research | 2004-11-22 | Paper |
scientific article; zbMATH DE number 2064414 (Why is no real title available?)
| 2004-05-18 | Paper |
scientific article; zbMATH DE number 2064418 (Why is no real title available?)
| 2004-05-18 | Paper |
Weighted graphs with all Hamiltonian cycles of the same length
Discrete Mathematics | 2003-09-25 | Paper |
TSP heuristics: domination analysis and complexity
Algorithmica | 2003-06-02 | Paper |
Fuzzy models for single-period inventory problem
Fuzzy Sets and Systems | 2003-04-02 | Paper |
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
Discrete Applied Mathematics | 2002-06-24 | Paper |
Domination analysis of some heuristics for the traveling salesman problem
Discrete Applied Mathematics | 2002-06-24 | Paper |
Fuzzy versions of the covering circle problem
European Journal of Operational Research | 2002-02-20 | Paper |
Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
International Game Theory Review | 2002-02-19 | Paper |
Integer solution for linear complementarity problem
Mathematics of Operations Research | 2001-11-26 | Paper |
Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions.
Algorithmica | 2001-09-27 | Paper |
Gilmore-Gomory type traveling salesman problems
Computers \& Operations Research | 2000-07-27 | Paper |
Pyramidal traveling salesman problem
Computers \& Operations Research | 1999-09-22 | Paper |
A generalization of the convex-hull-and-line traveling salesman problem
Journal of Applied Mathematics and Decision Sciences | 1999-08-19 | Paper |
Ratio combinatorial programs
European Journal of Operational Research | 1998-08-16 | Paper |
Clustering problems in optimization models
Computational Economics | 1997-01-22 | Paper |
An extension of a theorem of Fulkerson and Gross
Linear Algebra and its Applications | 1996-12-01 | Paper |
\(\varepsilon\)-approximation minimization of convex functions in fixed dimension
Operations Research Letters | 1996-08-01 | Paper |
On Optimal Replacement Policies—Random Horizon
Operations Research | 1994-09-15 | Paper |
scientific article; zbMATH DE number 16721 (Why is no real title available?)
| 1992-06-26 | Paper |
A problem in vision that is polynomially solvable
Opsearch | 1991-01-01 | Paper |
On totally dual integral systems
Discrete Applied Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4172712 (Why is no real title available?)
| 1990-01-01 | Paper |
Pseudomatroids
Discrete Mathematics | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4041025 (Why is no real title available?)
| 1988-01-01 | Paper |
Some NP-complete problems in quadratic and nonlinear programming
Mathematical Programming | 1987-01-01 | Paper |
Strongly polynomial algorithm for a class of combinatorial LCPs
Operations Research Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4041589 (Why is no real title available?)
| 1987-01-01 | Paper |
Some NP-complete problems in linear programming
Operations Research Letters | 1982-01-01 | Paper |
