| Publication | Date of Publication | Type |
|---|
A Numerically Exact Algorithm for the Bin-Packing Problem
INFORMS Journal on Computing | 2024-03-26 | Paper |
CliSAT: a new exact algorithm for hard maximum clique problems
European Journal of Operational Research | 2023-07-10 | Paper |
A combinatorial flow-based formulation for temporal bin packing problems
European Journal of Operational Research | 2023-07-04 | Paper |
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Optimization Letters | 2022-10-11 | Paper |
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Operations Research | 2022-09-19 | Paper |
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
INFORMS Journal on Computing | 2022-06-27 | Paper |
On the exact separation of cover inequalities of maximum-depth
Optimization Letters | 2022-03-15 | Paper |
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
European Journal of Operational Research | 2022-02-23 | Paper |
A branch-and-price algorithm for the minimum sum coloring problem
Discrete Applied Mathematics | 2021-09-15 | Paper |
A branch-and-cut algorithm for the edge interdiction clique problem
European Journal of Operational Research | 2021-06-08 | Paper |
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
European Journal of Operational Research | 2021-06-03 | Paper |
On integer and bilevel formulations for the \(k\)-vertex cut problem
Mathematical Programming Computation | 2020-08-27 | Paper |
A lexicographic pricer for the fractional bin packing problem
Operations Research Letters | 2020-02-10 | Paper |
A note on selective line-graphs and partition colorings
Operations Research Letters | 2020-02-10 | Paper |
Theoretical and computational study of several linearisation techniques for binary quadratic problems
Annals of Operations Research | 2020-01-20 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
A branch-and-price algorithm for the temporal bin packing problem
Computers & Operations Research | 2019-11-19 | Paper |
A new branch-and-bound algorithm for the maximum weighted clique problem
Computers & Operations Research | 2019-07-12 | Paper |
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
European Journal of Operational Research | 2019-06-25 | Paper |
The vertex \(k\)-cut problem
Discrete Optimization | 2019-06-13 | Paper |
The maximum clique interdiction problem
European Journal of Operational Research | 2019-03-28 | Paper |
Improving the approximated projected perspective reformulation by dual information
Operations Research Letters | 2019-02-22 | Paper |
Benders decomposition for very large scale partial set covering and maximal covering location problems
European Journal of Operational Research | 2019-02-11 | Paper |
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
On the product knapsack problem
Optimization Letters | 2018-08-03 | Paper |
An exact algorithm for the partition coloring problem
Computers & Operations Research | 2018-07-12 | Paper |
Exact approaches for the knapsack problem with setups
Computers & Operations Research | 2018-07-11 | Paper |
An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
Networks | 2018-06-13 | Paper |
| ILP models and column generation for the minimum sum coloring problem | 2018-04-11 | Paper |
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
European Journal of Operational Research | 2017-12-06 | Paper |
Solving vertex coloring problems as maximum weight stable set problems
Discrete Applied Mathematics | 2017-03-15 | Paper |
Modeling two-dimensional guillotine cutting problems via integer programming
INFORMS Journal on Computing | 2017-02-08 | Paper |
MIP formulations for a rich real-world lot-sizing problem with setup carryover
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Models for the two-dimensional two-stage cutting stock problem with multiple stock size
Computers & Operations Research | 2016-11-10 | Paper |
| Lower bounding techniques for DSATUR-based branch and bound | 2016-10-18 | Paper |
ILP and CP formulations for the lazy bureaucrat problem
Integration of AI and OR Techniques in Constraint Programming | 2016-07-25 | Paper |
Approximated perspective relaxations: a project and lift approach
Computational Optimization and Applications | 2016-04-04 | Paper |
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
Information Processing Letters | 2016-03-01 | Paper |
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
INFORMS Journal on Computing | 2016-01-25 | Paper |
Improved rolling horizon approaches to the aircraft sequencing problem
Journal of Scheduling | 2015-11-12 | Paper |
State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
Decomposition and reformulation of integer linear programming problems. (Summary)
4OR | 2013-02-06 | Paper |
Aircraft sequencing problems via a rolling horizon algorithm
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Exact weighted vertex coloring via branch-and-price
Discrete Optimization | 2012-09-11 | Paper |
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
European Journal of Operational Research | 2012-08-16 | Paper |
Partial convexification of general mips by Dantzig-Wolfe reformulation
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
