| Publication | Date of Publication | Type |
|---|
A heuristic algorithm for the set covering problem
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications
IEEE Transactions on Computers | 2017-07-12 | Paper |
A new lower bound for curriculum-based course timetabling
Computers & Operations Research | 2016-11-10 | Paper |
Bilevel knapsack with interdiction constraints
INFORMS Journal on Computing | 2016-08-12 | Paper |
Improving a family of approximation algorithms to edge color multigraphs
Information Processing Letters | 2016-06-09 | Paper |
Theoretical and computational results about optimality-based domain reductions
Computational Optimization and Applications | 2016-05-25 | Paper |
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
Information Processing Letters | 2016-03-01 | Paper |
Friendly bin packing instances without integer round-up property
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
A study on the computational complexity of the bilevel knapsack problem
SIAM Journal on Optimization | 2014-09-26 | Paper |
Delay-robust event scheduling
Operations Research | 2014-08-11 | Paper |
A Lagrangian heuristic for a train-unit assignment problem
Discrete Applied Mathematics | 2014-04-16 | Paper |
Lower bounds for the minimum linear arrangement of a graph
| 2013-11-08 | Paper |
On integer polytopes with few nonzero vertices
Operations Research Letters | 2013-06-24 | Paper |
A complexity and approximability study of the bilevel knapsack problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Finding cliques of maximum weight on a generalization of permutation graphs
Optimization Letters | 2013-03-07 | Paper |
Optimal linear arrangements using betweenness variables
Mathematical Programming Computation | 2012-11-27 | Paper |
Models and algorithms for the train unit assignment problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
An effective branch-and-bound algorithm for convex quadratic integer programming
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Robust train routing and online re-scheduling
| 2012-09-28 | Paper |
Recoverable robustness for railway rolling stock planning
| 2012-09-28 | Paper |
04. Solution of the train platforming problem
| 2012-09-28 | Paper |
Solving a real-world train unit assignment problem
| 2012-09-28 | Paper |
Almost 20 years of combinatorial optimization for railway planning: from Lagrangian relaxation to column generation
| 2012-09-28 | Paper |
Decorous lower bounds for minimum linear arrangement
INFORMS Journal on Computing | 2012-07-28 | Paper |
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete Optimization | 2012-06-20 | Paper |
Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
INFORMS Journal on Computing | 2012-06-18 | Paper |
Laying out sparse graphs with provably minimum bandwidth
INFORMS Journal on Computing | 2012-06-08 | Paper |
The reversal median problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
Sorting permutations by reversals through branch-and-price
INFORMS Journal on Computing | 2012-05-30 | Paper |
Partial convexification of general mips by Dantzig-Wolfe reformulation
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Global optimization problems and domain reduction strategies
Mathematical Programming. Series A. Series B | 2010-10-13 | Paper |
Solving a real-world train-unit assignment problem
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
New techniques for cost sharing in combinatorial optimization games
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
SIAM Journal on Computing | 2010-09-06 | Paper |
An effective branch-and-bound algorithm for convex quadratic integer programming
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Non-cyclic train timetabling and comparability graphs
Operations Research Letters | 2010-06-08 | Paper |
Modified subset sum heuristics for bin packing
Information Processing Letters | 2009-12-18 | Paper |
A structural lemma in 2-dimensional packing, and its implications on approximability
Algorithms and Computation | 2009-12-17 | Paper |
Modeling and Solving the Train Timetabling Problem
Operations Research | 2009-07-03 | Paper |
Bidimensional packing by bilinear programming
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
A column generation approach to train timetabling on a corridor
4OR | 2008-09-04 | Paper |
A New Lower Bound for the Minimum Linear Arrangement of a Graph
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Packing d-Dimensional Bins in d Stages
Mathematics of Operations Research | 2008-05-27 | Paper |
Experimental and statistical analysis of sorting by reversals
| 2008-04-14 | Paper |
Constrained 0-1 quadratic programming: basic approaches and extensions
European Journal of Operational Research | 2008-01-21 | Paper |
Bidimensional Packing by Bilinear Programming
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Packing into the smallest square: worst-case analysis of lower bounds
Discrete Optimization | 2007-02-20 | Paper |
A Lagrangian heuristic algorithm for a real-world train timetabling problem
Discrete Applied Mathematics | 2006-04-28 | Paper |
A branch-and-cut algorithm for multiple sequence alignment
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
Mathematics of Operations Research | 2005-11-11 | Paper |
Ond-threshold graphs andd-dimensional bin packing
Networks | 2005-01-12 | Paper |
Packing cuts in undirected graphs
Networks | 2004-08-20 | Paper |
scientific article; zbMATH DE number 2086931 (Why is no real title available?)
| 2004-08-11 | Paper |
On the two-dimensional knapsack problem
Operations Research Letters | 2004-07-01 | Paper |
Approximation schemes for ordered vector packing problems
Naval Research Logistics | 2004-03-15 | Paper |
Packing cycles in undirected graphs
Journal of Algorithms | 2004-03-14 | Paper |
Models and algorithms for a staff scheduling problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Worst-case analysis of the subset sum algorithm for bin packing.
Operations Research Letters | 2004-01-05 | Paper |
On the separation of split cuts and related inequalities
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
A 3/4-approximation algorithm for multiple subset sum
Journal of Heuristics | 2003-08-28 | Paper |
On the Practical Solution of the Reversal Median Problem
Lecture Notes in Computer Science | 2003-04-06 | Paper |
scientific article; zbMATH DE number 1875440 (Why is no real title available?)
| 2003-03-02 | Paper |
Packing triangles in bounded degree graphs.
Information Processing Letters | 2003-01-21 | Paper |
On the stability number of the edge intersection of two graphs.
Information Processing Letters | 2003-01-21 | Paper |
Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
SIAM Journal on Optimization | 2003-01-05 | Paper |
scientific article; zbMATH DE number 1833403 (Why is no real title available?)
| 2002-11-21 | Paper |
Lower bounds and algorithms for the 2-dimensional vector packing problem
Discrete Applied Mathematics | 2002-11-04 | Paper |
A PTAS for the multiple subset sum problem with different knapsack capacities
Information Processing Letters | 2002-07-25 | Paper |
Modeling and solving the crew rostering problem
Operations Research | 2002-07-01 | Paper |
Improved approximation for breakpoint graph decomposition and sorting by reversals
Journal of Combinatorial Optimization | 2002-05-28 | Paper |
On bandwidth-2 graphs
Discrete Applied Mathematics | 2002-05-15 | Paper |
A Heuristic Method for the Set Covering Problem
Operations Research | 2002-01-13 | Paper |
scientific article; zbMATH DE number 1301598 (Why is no real title available?)
| 2002-01-03 | Paper |
scientific article; zbMATH DE number 1683912 (Why is no real title available?)
| 2001-12-18 | Paper |
scientific article; zbMATH DE number 1670531 (Why is no real title available?)
| 2001-11-11 | Paper |
Separating lifted odd-hole inequalities to solve the index selection problem
Discrete Applied Mathematics | 2001-09-03 | Paper |
Algorithms for the set covering problem
Annals of Operations Research | 2001-06-14 | Paper |
On the separation of maximally violated mod-\(k\) cuts
Mathematical Programming. Series A. Series B | 2001-05-02 | Paper |
The multiple subset sum problem
SIAM Journal on Optimization | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1342122 (Why is no real title available?)
| 2001-03-04 | Paper |
Approximation algorithms for knapsack problems with cardinality constraints
European Journal of Operational Research | 2000-07-09 | Paper |
scientific article; zbMATH DE number 1445280 (Why is no real title available?)
| 2000-05-10 | Paper |
On the tightness of the alternating-cycle lower bound for sorting by reversals
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1361550 (Why is no real title available?)
| 1999-11-10 | Paper |
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
Properties of some ILP formulations of a class of partitioning problems
Discrete Applied Mathematics | 1999-04-19 | Paper |
Exact Solution of the Quadratic Knapsack Problem
INFORMS Journal on Computing | 1999-01-01 | Paper |
scientific article; zbMATH DE number 1175944 (Why is no real title available?)
| 1998-07-19 | Paper |
Algorithms for railway crew management
Mathematical Programming. Series A. Series B | 1997-08-28 | Paper |
\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
Mathematical Programming. Series A. Series B | 1996-11-24 | Paper |
A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
Top | 1996-10-31 | Paper |
