| Publication | Date of Publication | Type |
|---|
On the approximability of some maximum spanning tree problems
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
On minimum reload cost cycle cover
Discrete Applied Mathematics | 2015-09-22 | Paper |
| On binary matroids not isomorphic to their base matroids | 2014-02-19 | Paper |
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
Yugoslav Journal of Operations Research | 2013-06-10 | Paper |
A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem
International Transactions in Operational Research | 2013-05-23 | Paper |
| The minimum fundamental cycle basic problem: a new heuristic based on edge swaps | 2013-01-10 | Paper |
On minimum reload cost cycle cover
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On minimum reload cost paths, tours, and flows
Networks | 2011-06-22 | Paper |
On minimum changeover cost arborescences
Experimental Algorithms | 2011-06-10 | Paper |
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
Networks | 2010-11-24 | Paper |
Minimum cut bases in undirected networks
Discrete Applied Mathematics | 2010-05-05 | Paper |
| Extensions of matroids to uniform matroids | 2010-03-31 | Paper |
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
A branch-and-cut method for the obnoxious \(p\)-median problem
4OR | 2008-05-20 | Paper |
Approximating Maximum Cut with Limited Unbalance
Approximation and Online Algorithms | 2008-02-21 | Paper |
Approximation algorithms for maximum cut with limited unbalance
Theoretical Computer Science | 2007-10-18 | Paper |
Least and most colored bases
Discrete Applied Mathematics | 2007-09-19 | Paper |
Algorithms for finding minimum fundamental cycle bases in graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximating Max Cut with Limited Unbalance
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Solving minimum K-cardinality cut problems in planar graphs
Networks | 2007-02-02 | Paper |
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics | 2006-06-09 | Paper |
On some properties of base-matroids
Discrete Applied Mathematics | 2006-06-09 | Paper |
| scientific article; zbMATH DE number 2230248 (Why is no real title available?) | 2005-11-18 | Paper |
Cardinality constrained minimum cut problems: complexity and algorithms.
Discrete Applied Mathematics | 2004-03-14 | Paper |
On the complexity of graph tree partition problems.
Discrete Applied Mathematics | 2004-01-26 | Paper |
Discrete facility location and routing of obnoxious activities.
Discrete Applied Mathematics | 2004-01-05 | Paper |
New bounds for optimum traffic assignment in satellite communication.
Computers & Operations Research | 2003-09-07 | Paper |
The base-matroid and inverse combinatorial optimization problems.
Discrete Applied Mathematics | 2003-06-10 | Paper |
Solving the Two-Connected Network with Bounded Meshes Problem
Operations Research | 2002-06-04 | Paper |
| scientific article; zbMATH DE number 1706198 (Why is no real title available?) | 2002-03-03 | Paper |
Approximability of hard combinatorial optimization problems: an introduction
Annals of Operations Research | 2001-01-17 | Paper |
Combining linear and nonlinear objectives in spanning tree problems
Journal of Combinatorial Optimization | 2000-10-30 | Paper |
Randomized algorithms over finite fields for the exact parity base problem.
Journal of Complexity | 2000-09-03 | Paper |
Solving the feedback vertex set problem on undirected graphs
Discrete Applied Mathematics | 2000-04-09 | Paper |
Exact solution of the SONET ring loading problem
Operations Research Letters | 2000-01-31 | Paper |
Solution of the cumulative assignment problem with a well-structured tabu search method
Journal of Heuristics | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1253067 (Why is no real title available?) | 1999-02-22 | Paper |
A bound for the symmetric travelling salesman problem through matroid formulation
European Journal of Operational Research | 1999-01-27 | Paper |
| scientific article; zbMATH DE number 1222099 (Why is no real title available?) | 1998-11-11 | Paper |
A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
Annals of Operations Research | 1998-09-27 | Paper |
| scientific article; zbMATH DE number 1195632 (Why is no real title available?) | 1998-09-01 | Paper |
On the approximability of some Maximum Spanning Tree Problems
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1175941 (Why is no real title available?) | 1998-07-19 | Paper |
A mixed-integer model for solving ordering problems with side constraints
Annals of Operations Research | 1998-02-05 | Paper |
| scientific article; zbMATH DE number 1054945 (Why is no real title available?) | 1997-10-27 | Paper |
Heuristics from Nature for Hard Combinatorial Optimization Problems
International Transactions in Operational Research | 1997-01-15 | Paper |
On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
International Transactions in Operational Research | 1997-01-06 | Paper |
| Complexity of spanning tree problems with leaf-dependent objectives | 1996-08-05 | Paper |
On some multicriteria arborescence problems: Complexity and algorithms
Discrete Applied Mathematics | 1996-07-07 | Paper |
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters | 1996-02-26 | Paper |
On the computation of pfaffians
Discrete Applied Mathematics | 1994-07-31 | Paper |
Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
Networks | 1994-05-09 | Paper |
Note on combinatorial optimization with max-linear objective functions
Discrete Applied Mathematics | 1993-06-29 | Paper |
In memoriam Paolo M. Camerini
Discrete Applied Mathematics | 1993-06-29 | Paper |
Random pseudo-polynomial algorithms for some combinatorial programming problems
European Journal of Operational Research | 1992-10-06 | Paper |
Random pseudo-polynomial algorithms for exact matroid problems
Journal of Algorithms | 1992-06-28 | Paper |
The image of weighted combinatorial problems
Annals of Operations Research | 1992-06-27 | Paper |
Multi-constrained matroidal knapsack problems
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4125200 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4123305 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3980505 (Why is no real title available?) | 1986-01-01 | Paper |
Randomized algorithms in combinatorial optimization: A survey
Discrete Applied Mathematics | 1986-01-01 | Paper |
Most and least uniform spanning trees
Discrete Applied Mathematics | 1986-01-01 | Paper |
Some experience in applying a stochastic method to location problems
Mathematical Programming Studies | 1986-01-01 | Paper |
Linking-Centers and Reliable-Trees of a Network
IEEE Transactions on Reliability | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900496 (Why is no real title available?) | 1985-01-01 | Paper |
Unlabelled Partition Systems: Optimization and Complexity
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
On the complexity of finding multi-constrained spanning trees
Discrete Applied Mathematics | 1983-01-01 | Paper |
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
Networks | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3946155 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3743040 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3672014 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3731752 (Why is no real title available?) | 1980-01-01 | Paper |
Complexity of spanning tree problems: Part I
European Journal of Operational Research | 1980-01-01 | Paper |
Thek best spanning arborescences of a network
Networks | 1980-01-01 | Paper |
Ranking arborescences in O(Km log n) time
European Journal of Operational Research | 1980-01-01 | Paper |
Polynomial bounding for NP-hard problems
Mathematical Programming Studies | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3634015 (Why is no real title available?) | 1979-01-01 | Paper |
A note on finding optimum branchings
Networks | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3639649 (Why is no real title available?) | 1978-01-01 | Paper |
Heuristically guided algorithm for k-parity matroid problems
Discrete Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3543817 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3547080 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3557512 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3532755 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3561092 (Why is no real title available?) | 1975-01-01 | Paper |
Bounds for 3-matroid intersection problems
Information Processing Letters | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3430520 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3446692 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3319334 (Why is no real title available?) | 1969-01-01 | Paper |
