| Publication | Date of Publication | Type |
|---|
Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Quantum annealing versus digital computing. An experimental comparison
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
Applied Mathematical Sciences | 2022-04-06 | Paper |
Solving the Earth observing satellite constellation scheduling problem by Branch-and-Price
Operations Research Proceedings | 2019-09-13 | Paper |
A mixed integer linear programming model for multi-satellite scheduling
European Journal of Operational Research | 2019-01-28 | Paper |
A polyhedral approach to the feedback vertex set problem
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A first derivative Potts model for segmentation and denoising using ILP
Operations Research Proceedings | 2018-10-09 | Paper |
The capacitated arc routing problem: combinatorial lower bounds
| 2017-07-11 | Paper |
The LP-Newton Method and Conic Optimization
| 2016-11-28 | Paper |
PANDA: a software for polyhedral transformations
EURO Journal on Computational Optimization | 2016-01-14 | Paper |
The Lagrangian relaxation for the combinatorial integral approximation problem
Optimization Methods \& Software | 2015-09-04 | Paper |
A branch and cut solver for the maximum stable set problem
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
Evaluating the quality of image matrices in blockmodeling
EURO Journal on Computational Optimization | 2015-07-31 | Paper |
Martin Grötschel—The Early Years in Bonn and Augsburg
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
On a binary distance model for the minimum linear arrangement problem
Top | 2014-10-08 | Paper |
A branch-and-bound algorithm for the coupled task problem
Mathematical Methods of Operations Research | 2014-09-08 | Paper |
Lifting and separation procedures for the cut polytope
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
On-line bin packing with restricted repacking
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization | 2013-05-31 | Paper |
A tutorial on branch and cut algorithms for the maximum stable set problem
International Transactions in Operational Research | 2013-04-24 | Paper |
Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
Journal of Statistical Physics | 2013-04-10 | Paper |
Exact solution of the 2-dimensional grid arrangement problem
Discrete Optimization | 2012-12-28 | Paper |
Optimal linear arrangements using betweenness variables
Mathematical Programming Computation | 2012-11-27 | Paper |
On a multidimensional semi-on-line bin packing problem
| 2012-08-29 | Paper |
A benchmark library and a comparison of heuristic methods for the linear ordering problem
Computational Optimization and Applications | 2012-06-19 | Paper |
Maximally violated mod-\(p\) cuts for the capacitated vehicle-routing problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
A heuristic for an earth observing satellite constellation scheduling problem with download considerations
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
New results on the windy postman problem
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
Heuristics for budget facility location-network design problems with minisum objective
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Optimizing in Graphs with Expensive Computation of Edge Weights
Operations Research Proceedings | 2011-04-07 | Paper |
Parallel computation for the bandwidth minimization problem
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Applied Mathematical Sciences | 2010-12-16 | Paper |
On a class of metrics related to graph layout problems
Linear Algebra and its Applications | 2010-11-05 | Paper |
Traces of the XII Aussois Workshop on combinatorial optimization
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Odd Minimum Cut Sets and b-Matchings Revisited
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Applying mod-\(k\)-cuts for solving linear ordering problems
Top | 2009-09-03 | Paper |
BoxStep methods for crew pairing problems
Optimization and Engineering | 2009-08-12 | Paper |
The simultaneous consecutive ones problem
Theoretical Computer Science | 2009-05-28 | Paper |
Improved analysis of an algorithm for the coupled task problem with UET jobs
Operations Research Letters | 2009-05-07 | Paper |
Direct methods with maximal lower bound for mixed-integer optimal control problems
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
Lower Bound for the Online Bin Packing Problem with Restricted Repacking
SIAM Journal on Computing | 2009-03-16 | Paper |
Solutions to city bus scheduling problems
| 2008-06-11 | Paper |
Solutions to city bus scheduling problems with parallelization algorithm
| 2008-04-29 | Paper |
Solutions to city bus scheduling problems
| 2008-04-03 | Paper |
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics | 2008-02-26 | Paper |
On the general routing polytope
Discrete Applied Mathematics | 2008-02-26 | Paper |
Not Every GTSP Facet Induces an STSP Facet
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL \leftrightharpoons Beta \leftrightharpoons AlphaR Transitions in Octaalanine
Multiscale Modeling & Simulation | 2007-06-26 | Paper |
On the graphical relaxation of the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Locating health facilities in Nouna district, Burkina Faso
| 2007-01-22 | Paper |
scientific article; zbMATH DE number 5070329 (Why is no real title available?)
| 2006-11-02 | Paper |
Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
Journal of Statistical Physics | 2006-08-23 | Paper |
A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
Computers \& Operations Research | 2006-06-30 | Paper |
A note on the undirected rural postman problem polytope
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Transformation of Facets of the General Routing Problem Polytope
SIAM Journal on Optimization | 2005-09-16 | Paper |
scientific article; zbMATH DE number 2196283 (Why is no real title available?)
| 2005-08-22 | Paper |
DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
scientific article; zbMATH DE number 2159019 (Why is no real title available?)
| 2005-04-19 | Paper |
scientific article; zbMATH DE number 2159169 (Why is no real title available?)
| 2005-04-19 | Paper |
scientific article; zbMATH DE number 2159154 (Why is no real title available?)
| 2005-04-19 | Paper |
scientific article; zbMATH DE number 2153000 (Why is no real title available?)
| 2005-04-05 | Paper |
An exact algorithm for scheduling identical coupled tasks
Mathematical Methods of Operations Research | 2005-02-11 | Paper |
A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
Computational Optimization and Applications | 2003-08-26 | Paper |
The weighted consecutive ones problem for a fixed number of rows or columns.
Operations Research Letters | 2003-08-13 | Paper |
scientific article; zbMATH DE number 1953198 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1947382 (Why is no real title available?)
| 2003-07-08 | Paper |
Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
Algorithmica | 2001-08-09 | Paper |
scientific article; zbMATH DE number 1594515 (Why is no real title available?)
| 2001-05-06 | Paper |
scientific article; zbMATH DE number 1696653 (Why is no real title available?)
| 2000-01-01 | Paper |
scientific article; zbMATH DE number 1187154 (Why is no real title available?)
| 1998-08-10 | Paper |
scientific article; zbMATH DE number 1175953 (Why is no real title available?)
| 1998-07-19 | Paper |
scientific article; zbMATH DE number 1058028 (Why is no real title available?)
| 1997-12-11 | Paper |
Combinatorial optimization and small polytopes
Top | 1997-03-23 | Paper |
scientific article; zbMATH DE number 780782 (Why is no real title available?)
| 1996-04-28 | Paper |
scientific article; zbMATH DE number 795217 (Why is no real title available?)
| 1996-03-05 | Paper |
Provably good solutions for the traveling salesman problem
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research | 1995-06-25 | Paper |
The traveling salesman. Computational solutions for RSP applications
Lecture Notes in Computer Science | 1994-12-01 | Paper |
Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
Mathematical Programming. Series A. Series B | 1994-12-01 | Paper |
A note on small linear-ordering polytopes
Discrete \& Computational Geometry | 1993-09-02 | Paper |
scientific article; zbMATH DE number 219017 (Why is no real title available?)
| 1993-08-22 | Paper |
Fast Heuristics for Large Geometric Traveling Salesman Problems
ORSA Journal on Computing | 1993-04-01 | Paper |
TSPLIB—A Traveling Salesman Problem Library
ORSA Journal on Computing | 1993-02-11 | Paper |
A complete description of the traveling salesman polytope on 8 nodes
Operations Research Letters | 1992-06-28 | Paper |
Computing correct Delaunay triangulations
Computing | 1992-06-26 | Paper |
scientific article; zbMATH DE number 17632 (Why is no real title available?)
| 1992-06-26 | Paper |
Optimal control of plotting and drilling machines: A case study
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1991-01-01 | Paper |
Via Minimization with Pin Preassignments and Layer Preference
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik | 1989-01-01 | Paper |
Experiments in quadratic 0-1 programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Operations Research | 1988-01-01 | Paper |
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
Mathematics of Operations Research | 1987-01-01 | Paper |
On partitioning the edges of graphs into connected subgraphs
Journal of Graph Theory | 1985-01-01 | Paper |
Facets of the linear ordering polytope
Mathematical Programming | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3902051 (Why is no real title available?)
| 1985-01-01 | Paper |
On the acyclic subgraph polytope
Mathematical Programming | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3902393 (Why is no real title available?)
| 1985-01-01 | Paper |
A Cutting Plane Algorithm for the Linear Ordering Problem
Operations Research | 1984-01-01 | Paper |
