| Publication | Date of Publication | Type |
|---|
A computational study on integer programming formulations for hop-constrained survivable network design
Discrete Applied Mathematics | 2025-01-06 | Paper |
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Adjustable Robust Optimization with Discrete Uncertainty
INFORMS Journal on Computing | 2024-03-26 | Paper |
In search of dense subgraphs: How good is greedy peeling?
Networks | 2023-12-11 | Paper |
In search of dense subgraphs: How good is greedy peeling?
Networks | 2023-12-11 | Paper |
Adjustable robust optimization with objective uncertainty
European Journal of Operational Research | 2023-11-14 | Paper |
An exact method for binary fortification games
European Journal of Operational Research | 2023-07-10 | Paper |
Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case''
European Journal of Operational Research | 2023-07-04 | Paper |
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
INFORMS Journal on Computing | 2022-12-01 | Paper |
K-adaptability in stochastic optimization
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Exact algorithms for the 0-1 time-bomb knapsack problem
Computers & Operations Research | 2022-06-22 | Paper |
2DPackLib: a two-dimensional cutting and packing library
Optimization Letters | 2022-03-15 | Paper |
The assignment and loading transportation problem
European Journal of Operational Research | 2021-06-03 | Paper |
Exact solution techniques for two-dimensional cutting and packing
European Journal of Operational Research | 2021-06-03 | Paper |
Lower and upper bounds for the non-linear generalized assignment problem
Computers & Operations Research | 2021-04-20 | Paper |
Interdiction Games and Monotonicity, with Application to Knapsack Problems
INFORMS Journal on Computing | 2020-12-03 | Paper |
A branch-and-cut algorithm for mixed-integer bilinear programming
European Journal of Operational Research | 2020-01-08 | Paper |
Minimum tiling of a rectangle by squares
Annals of Operations Research | 2019-03-06 | Paper |
Integer optimization with penalized fractional values: the knapsack case
European Journal of Operational Research | 2018-12-06 | Paper |
On the use of intersection cuts for bilevel optimization
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On the product knapsack problem
Optimization Letters | 2018-08-03 | Paper |
Least cost influence propagation in (social) networks
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
Exact approaches for the knapsack problem with setups
Computers & Operations Research | 2018-07-11 | Paper |
SelfSplit parallelization for mixed-integer linear programming
Computers & Operations Research | 2018-07-11 | Paper |
A dynamic reformulation heuristic for generalized interdiction problems
European Journal of Operational Research | 2018-05-30 | Paper |
Mixed-integer linear programming heuristics for the prepack optimization problem
Discrete Optimization | 2018-05-24 | Paper |
Thinning out Steiner trees: a node-based model for uniform edge costs
Mathematical Programming Computation | 2018-02-23 | Paper |
Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
European Journal of Operational Research | 2018-02-06 | Paper |
A new general-purpose algorithm for mixed-integer bilevel linear programs
Operations Research | 2018-01-11 | Paper |
Proximity search for 0--1 mixed-integer convex programming
Journal of Heuristics | 2017-04-26 | Paper |
Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
Discrete Applied Mathematics | 2016-12-22 | Paper |
On handling indicator constraints in mixed integer programming
Computational Optimization and Applications | 2016-12-15 | Paper |
Models and algorithms for packing rectangles into the smallest square
Computers & Operations Research | 2016-11-17 | Paper |
Exact solution of the robust knapsack problem
Computers & Operations Research | 2016-11-10 | Paper |
Intersection cuts for bilevel optimization
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Theoretical and computational results about optimality-based domain reductions
Computational Optimization and Applications | 2016-05-25 | Paper |
Improving branch-and-cut performance by random sampling
Mathematical Programming Computation | 2016-04-13 | Paper |
Exploiting erraticism in search
Operations Research | 2014-06-26 | Paper |
On the robust knapsack problem
SIAM Journal on Optimization | 2014-04-09 | Paper |
Cutting plane versus compact formulations for uncertain (integer) linear programs
Mathematical Programming Computation | 2013-08-05 | Paper |
Three Ideas for the Quadratic Assignment Problem
Operations Research | 2012-12-07 | Paper |
Complexity and approximation of an area packing problem
Optimization Letters | 2012-11-30 | Paper |
Exact algorithms for the two-dimensional guillotine knapsack
Computers & Operations Research | 2012-11-15 | Paper |
Branching on nonchimerical fractionalities
Operations Research Letters | 2012-08-17 | Paper |
A metaheuristic approach for the vertex coloring problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Heuristic and exact algorithms for the identical parallel machine scheduling problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
An exact approach for the vertex coloring problem
Discrete Optimization | 2012-06-20 | Paper |
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete Optimization | 2012-06-20 | Paper |
A set-covering-based heuristic approach for bin-packing problems
INFORMS Journal on Computing | 2012-06-18 | Paper |
An exact approach to the strip-packing problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
Backdoor branching
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
| Two-dimensional bin packing problems | 2010-12-08 | Paper |
Light robustness
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Models and heuristic algorithms for a weighted vertex coloring problem
Journal of Heuristics | 2009-11-20 | Paper |
An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
Computers & Operations Research | 2009-06-18 | Paper |
Bidimensional packing by bilinear programming
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
How tight is the corner relaxation?
Discrete Optimization | 2008-10-29 | 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 |
Lower bounds and heuristic algorithms for the k_i-partitioning problem
European Journal of Operational Research | 2006-03-22 | Paper |
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
Mathematics of Operations Research | 2005-11-11 | 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 |
Algorithms for packing and scheduling problems. (Abstract of thesis)
4OR | 2004-05-18 | Paper |
Models and algorithms for a staff scheduling problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2050771 (Why is no real title available?) | 2004-03-07 | Paper |
Integer linear programming models for 2-staged two-dimensional knapsack problems
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
Two-dimensional packing problems: a survey
European Journal of Operational Research | 2002-11-17 | Paper |
| scientific article; zbMATH DE number 1683912 (Why is no real title available?) | 2001-12-18 | Paper |
