| Publication | Date of Publication | Type |
|---|
Single machine adversarial bilevel scheduling problems
European Journal of Operational Research | 2024-06-13 | Paper |
Moderate exponential-time algorithms for scheduling problems
4OR | 2022-11-17 | Paper |
Exact solution of the two-machine flow shop problem with three operations
Computers \& Operations Research | 2022-03-09 | Paper |
Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
Applied Mathematics and Computation | 2021-11-09 | Paper |
Merging combinatorial design and optimization: the Oberwolfach problem
| 2021-05-28 | Paper |
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
Computers \& Operations Research | 2021-05-21 | Paper |
\textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
Computers \& Operations Research | 2021-05-21 | Paper |
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
| 2020-05-27 | Paper |
The longest processing time rule for identical parallel machines revisited
Journal of Scheduling | 2020-04-22 | Paper |
An enhanced pinwheel algorithm for the bamboo garden trimming problem
| 2020-03-27 | Paper |
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
| 2020-02-06 | Paper |
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
Journal of Scheduling | 2019-10-08 | Paper |
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
On approximating the incremental knapsack problem
Discrete Applied Mathematics | 2019-06-20 | Paper |
A solution to a Partitioned Balanced Tournament Design of side 11
| 2019-03-14 | Paper |
Approximating the 3-period incremental knapsack problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
New exact approaches and approximation results for the penalized knapsack problem
Discrete Applied Mathematics | 2018-12-18 | Paper |
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
Theoretical Computer Science | 2018-09-24 | Paper |
An exact approach for the 0-1 knapsack problem with setups
Computers \& Operations Research | 2018-07-11 | Paper |
Approximation results for the incremental knapsack problem
| 2018-06-15 | Paper |
A new exact approach for the 0-1 collapsing knapsack problem
European Journal of Operational Research | 2018-05-29 | Paper |
A constraint generation approach for two-machine shop problems with jobs selection
European Journal of Operational Research | 2018-05-25 | Paper |
An exact semidefinite programming approach for the max-mean dispersion problem
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Minimizing the number of tardy jobs in two-machine settings with common due date
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
A hybrid three-phase approach for the Max-Mean dispersion problem
Computers \& Operations Research | 2016-11-17 | Paper |
A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
Computers \& Operations Research | 2016-11-11 | Paper |
A hybrid heuristic approach for single machine scheduling with release times
Computers \& Operations Research | 2016-11-10 | Paper |
The selective fixing algorithm for the closest string problem
Computers \& Operations Research | 2016-11-10 | Paper |
A single machine scheduling problem with two-dimensional vector packing constraints
European Journal of Operational Research | 2016-10-06 | Paper |
The Red-Blue transportation problem
European Journal of Operational Research | 2016-06-23 | Paper |
MP or not MP: that is the question
Journal of Scheduling | 2016-05-13 | Paper |
Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
Operations Research | 2015-11-20 | Paper |
A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
Lecture Notes in Computer Science | 2015-10-16 | Paper |
On the max min vertex cover problem
Discrete Applied Mathematics | 2015-09-30 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2015-01-22 | Paper |
Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
A variable neighborhood search based matheuristic for nurse rostering problems
Annals of Operations Research | 2014-11-26 | Paper |
A matheuristic approach for the two-machine total completion time flow shop problem
Annals of Operations Research | 2014-09-26 | Paper |
On the max min vertex cover problem
Approximation and Online Algorithms | 2014-09-02 | Paper |
Reoptimization in machine scheduling
Theoretical Computer Science | 2014-06-06 | Paper |
Approximating the metric 2-peripatetic salesman problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Fast algorithms for min independent dominating set
Discrete Applied Mathematics | 2013-03-12 | Paper |
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Computers \& Operations Research | 2012-11-15 | Paper |
Improved LP-based algorithms for the closest string problem
Computers \& Operations Research | 2012-11-15 | Paper |
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
Computers \& Operations Research | 2012-11-15 | Paper |
Algorithms for dominating clique problems
Theoretical Computer Science | 2012-11-08 | Paper |
A note on minimizing the sum of quadratic completion times on two identical parallel machines
Information Processing Letters | 2012-10-23 | Paper |
Efficient algorithms for the max \(k\)-vertex cover problem
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Improving an exact approach for solving separable integer quadratic knapsack problems
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
INFORMS Journal on Computing | 2012-06-18 | Paper |
Discrete-time, economic lot scheduling problem on multiple, non-identical production lines
European Journal of Operational Research | 2012-05-14 | Paper |
Simplex algorithms for linear programming
| 2011-03-09 | Paper |
Mixed integer linear programming models for combinatorial optimization problems
| 2011-03-09 | Paper |
Improving the preemptive bound for the single machine dynamic maximum lateness problem
Operations Research Letters | 2010-12-23 | Paper |
Computational experience with a core-based reduction procedure for the 2-knapsack problem
Computers \& Operations Research | 2010-10-15 | Paper |
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
Journal of Scheduling | 2010-05-07 | Paper |
Exact algorithms for dominating clique problems (extended abstract)
Algorithms and Computation | 2009-12-17 | Paper |
Probabilistic graph-coloring in bipartite and split graphs
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Discrete Applied Mathematics | 2009-06-24 | Paper |
A heuristic approach for the max-min diversity problem based on max-clique
Computers \& Operations Research | 2009-04-03 | Paper |
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
Operational Research. An International Journal | 2009-02-17 | Paper |
Complexity of single machine scheduling problems under scenario-based uncertainty
Operations Research Letters | 2008-09-10 | Paper |
A ``maximum node clustering problem
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
An exact algorithm for MAX-CUT in sparse graphs
Operations Research Letters | 2008-01-21 | Paper |
Revisiting branch and bound search strategies for machine scheduling problems
Journal of Scheduling | 2007-12-20 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2007-12-20 | Paper |
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters | 2007-08-27 | Paper |
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Scheduling the Italian football league: an ILP-based approach
Computers \& Operations Research | 2006-01-18 | Paper |
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
The Journal of the Operational Research Society | 2005-03-14 | Paper |
Minimising makespan in the two-machine flow-shop with release times
The Journal of the Operational Research Society | 2005-01-19 | Paper |
A new decomposition approach for the single machine total tardiness scheduling problem
The Journal of the Operational Research Society | 2005-01-19 | Paper |
Solving the Hub location problem in telecommunication network design: A local search approach
Networks | 2005-01-12 | Paper |
Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
Journal of Heuristics | 2004-08-06 | Paper |
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
Operations Research Letters | 2004-07-01 | Paper |
scientific article; zbMATH DE number 2050782 (Why is no real title available?)
| 2004-03-07 | Paper |
A greedy-based neighborhood search approach to a nurse rostering problem.
European Journal of Operational Research | 2004-01-05 | Paper |
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Operations Research Letters | 2003-11-17 | Paper |
A Heuristic Algorithm for the Auto-Carrier Transportation Problem
Transportation Science | 2003-07-07 | Paper |
Finding the Pareto-optima for the total and maximum tardiness single machine problem
Discrete Applied Mathematics | 2002-12-02 | Paper |
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
European Journal of Operational Research | 2002-07-03 | Paper |
Algorithmic paradoxes of the single-machine total tardiness problem
Journal of Scheduling | 2001-07-12 | Paper |
Solution of the single machine total tardiness problem
Journal of Scheduling | 2001-07-08 | Paper |
An improved general procedure for lexicographic bottleneck problems
Operations Research Letters | 2001-02-09 | Paper |
Minimizing tardy jobs in a flowshop with common due date
European Journal of Operational Research | 2000-03-19 | Paper |
Scheduling a round robin tennis tournament under courts and players availability constraints
Annals of Operations Research | 2000-01-11 | Paper |
Aggregate planning and scheduling in the food industry: A case study
European Journal of Operational Research | 1998-12-08 | Paper |
Generalized pairwise interchanges and machine scheduling
European Journal of Operational Research | 1998-06-11 | Paper |
scientific article; zbMATH DE number 830014 (Why is no real title available?)
| 1996-07-29 | Paper |
Advanced search techniques for the job shop problem : a comparison
RAIRO - Operations Research | 1995-08-27 | Paper |
A genetic algorithm for the job shop problem
Computers \& Operations Research | 1995-02-13 | Paper |
A multi-KP modeling for the maximum-clique problem
European Journal of Operational Research | 1994-07-26 | Paper |
scientific article; zbMATH DE number 558542 (Why is no real title available?)
| 1994-04-28 | Paper |
Cellular control of manufacturing systems
European Journal of Operational Research | 1994-01-06 | Paper |
