| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7724189 (Why is no real title available?)
| 2023-08-08 | Paper |
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
Mathematical Programming Computation | 2023-07-24 | Paper |
Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
scientific article; zbMATH DE number 7559384 (Why is no real title available?)
| 2022-07-18 | Paper |
On inequalities with bounded coefficients and pitch for the min knapsack polytope
Discrete Optimization | 2022-06-09 | Paper |
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
ACM Transactions on Algorithms | 2022-02-22 | Paper |
High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
SIAM Journal on Optimization | 2021-03-11 | Paper |
Ideal Membership Problem for Boolean Minority
| 2020-06-29 | Paper |
Sum-of-squares hierarchy lower bounds for symmetric formulations
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
The complexity of the ideal membership problem for constrained problems over the Boolean domain
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
How to sell hyperedges: the hypermatching assignment problem
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Sum-of-squares rank upper bounds for matching problems
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On bounded pitch inequalities for the MIN-knapsack polytope
| 2018-08-17 | Paper |
Tight sum-of-squares lower bounds for binary polynomial optimization problems
| 2017-12-19 | Paper |
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
| 2017-08-31 | Paper |
On the hardest problem formulations for the 0/1 Lasserre hierarchy
Mathematics of Operations Research | 2017-04-13 | Paper |
Sum-of-squares rank upper bounds for matching problems
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Sum-of-squares hierarchy lower bounds for symmetric formulations
Lecture Notes in Computer Science | 2016-08-10 | Paper |
A Lasserre lower bound for the min-sum single machine scheduling problem
Algorithms - ESA 2015 | 2015-11-19 | Paper |
On the hardest problem formulations for the \(0/1\) Lasserre hierarchy
Automata, Languages, and Programming | 2015-10-27 | Paper |
Hybridizations of metaheuristics with branch \& bound derivates
Hybrid Metaheuristics | 2015-10-09 | Paper |
Improved approximation for the maximum duo-preservation string mapping problem
Lecture Notes in Computer Science | 2015-07-22 | Paper |
The feedback arc set problem with triangle inequality is a vertex cover problem
Algorithmica | 2015-01-19 | Paper |
Bi-criteria and approximation algorithms for restricted matchings
Theoretical Computer Science | 2014-06-06 | Paper |
Hardness of approximating flow and job shop scheduling problems
Journal of the ACM | 2014-02-17 | Paper |
Competitive-ratio approximation schemes for makespan scheduling problems
Approximation and Online Algorithms | 2013-09-13 | Paper |
Vertex cover in graphs with locally few colors
Information and Computation | 2013-06-06 | Paper |
Single machine scheduling with scenarios
Theoretical Computer Science | 2013-04-17 | Paper |
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics | 2013-03-12 | Paper |
Constrained matching problems in bipartite graphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Approximation of minimum cost homomorphisms
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Restricted max-min fair allocations with inclusion-free intervals
Lecture Notes in Computer Science | 2012-09-25 | Paper |
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
On the approximability of single-machine scheduling with precedence constraints
Mathematics of Operations Research | 2012-05-24 | Paper |
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing | 2011-07-29 | Paper |
Vertex cover in graphs with locally few colors
Automata, Languages and Programming | 2011-07-06 | Paper |
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters | 2010-12-20 | Paper |
Scheduling to minimize max flow time: offline and online algorithms.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
scientific article; zbMATH DE number 5605136 (Why is no real title available?)
| 2009-09-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Improved Bounds for Flow Shop Scheduling
Automata, Languages and Programming | 2009-07-14 | Paper |
Single machine precedence constrained scheduling is a Vertex cover problem
Algorithmica | 2009-05-06 | Paper |
Approximating Single Machine Scheduling with Scenarios
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Grouping techniques for scheduling problems: simpler and faster
Algorithmica | 2008-07-01 | Paper |
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Efficient approximation schemes for scheduling problems with release dates and delivery times
Journal of Scheduling | 2007-12-20 | Paper |
Scheduling with Precedence Constraints of Low Fractional Dimension
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
A linear time approximation scheme for the single machine scheduling problem with controllable processing times
Journal of Algorithms | 2006-10-05 | Paper |
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-09-28 | Paper |
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics | 2006-04-28 | Paper |
On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
Operations Research Letters | 2006-02-02 | Paper |
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Approximation schemes for job shop scheduling problems with controllable processing times
European Journal of Operational Research | 2005-08-04 | Paper |
SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
European Journal of Operational Research | 2005-06-01 | Paper |
Core instances for testing: a case study
European Journal of Operational Research | 2005-06-01 | Paper |
Approximation schemes for parallel machine scheduling problems with controllable processing times
Computers & Operations Research | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2089208 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2081111 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044496 (Why is no real title available?)
| 2004-02-18 | Paper |
Notes on max flow time minimization with controllable processing times
Computing | 2004-02-05 | Paper |
scientific article; zbMATH DE number 1982188 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1877047 (Why is no real title available?)
| 2003-03-05 | Paper |
scientific article; zbMATH DE number 1839478 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1512677 (Why is no real title available?)
| 2000-10-03 | Paper |
Effective neighbourhood functions for the flexible job shop problem
Journal of Scheduling | 2000-09-19 | Paper |
scientific article; zbMATH DE number 1975327 (Why is no real title available?)
| 2000-01-01 | Paper |
