Michele Monaci

INFORMS J. Comput., 2024

An iterated local search matheuristic approach for the multi-vehicle inventory routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

2023

Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888].

[BibT_eX]

[DOI]

Eur. J. Oper. Res., June, 2023

An exact method for binary fortification games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., June, 2023

2022

2DPackLib: a two-dimensional cutting and packing library.

[BibT_eX]

[DOI]

Manuel Iori

Vinícius Loti de Lima

Optim. Lett., 2022

K-adaptability in stochastic optimization.

[BibT_eX]

[DOI]

Jonas Pruente

Math. Program., 2022

Network Design with Service Requirements: Scaling-up the Size of Solvable Problems.

[BibT_eX]

[DOI]

Naga Venkata C. Gudapati

INFORMS J. Comput., 2022

Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.

[BibT_eX]

[DOI]

Ciara Pike-Burke

Alberto Santini

Comput. Oper. Res., 2022

2021

In search of dense subgraphs: How good is greedy peeling?

[BibT_eX]

[DOI]

Naga Venkata C. Gudapati

Networks, 2021

Exact solution techniques for two-dimensional cutting and packing.

[BibT_eX]

[DOI]

Manuel Iori

Vinícius Loti de Lima

Flávio Keidi Miyazawa

Jesper Runge Kristoffersen

Eur. J. Oper. Res., 2021

The assignment and loading transportation problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

An Exact Method for Fortification Games.

[BibT_eX]

[DOI]

CoRR, 2021

Models and algorithms for integrated production and distribution problems.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

2020

Vattenfall Optimizes Offshore Wind Farm Design.

[BibT_eX]

[DOI]

Martina Fischetti

Thomas Hjort

David Pisinger

INFORMS J. Appl. Anal., 2020

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Lower and upper bounds for the non-linear generalized assignment problem.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Comput. Oper. Res., 2020

High-resolution Catheters for Arrhythmic Driver Detection: Preliminary Results in Atrial Fibrillation.

[BibT_eX]

[DOI]

Proceedings of the Computing in Cardiology, 2020

2019

Interdiction Games and Monotonicity, with Application to Knapsack Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

Integer optimization with penalized fractional values: The Knapsack case.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

2018

On the Product Knapsack Problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

On the use of intersection cuts for bilevel optimization.

[BibT_eX]

[DOI]

Math. Program., 2018

Least cost influence propagation in (social) networks.

[BibT_eX]

[DOI]

Math. Program., 2018

A dynamic reformulation heuristic for Generalized Interdiction Problems.

[BibT_eX]

[DOI]

Markus Sinnl

Eur. J. Oper. Res., 2018

Exact approaches for the knapsack problem with setups.

[BibT_eX]

[DOI]

Fabio Furini

Emiliano Traversi

Comput. Oper. Res., 2018

SelfSplit parallelization for mixed-integer linear programming.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

Minimum tiling of a rectangle by squares.

[BibT_eX]

[DOI]

André Gustavo dos Santos

Ann. Oper. Res., 2018

2017

Thinning out Steiner trees: a node-based model for uniform edge costs.

[BibT_eX]

[DOI]

Math. Program. Comput., 2017

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.

[BibT_eX]

[DOI]

Oper. Res., 2017

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints.

[BibT_eX]

[DOI]

Enrico Pietrobuoni

Discret. Appl. Math., 2017

2016

Improving branch-and-cut performance by random sampling.

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

Proximity search heuristics for wind farm optimal layout.

[BibT_eX]

[DOI]

Martina Fischetti

J. Heuristics, 2016

Proximity Benders: a decomposition heuristic for stochastic programs.

[BibT_eX]

[DOI]

Natashia Boland

Martin W. P. Savelsbergh

J. Heuristics, 2016

Mixed-integer linear programming heuristics for the prepack optimization problem.

[BibT_eX]

[DOI]

Discret. Optim., 2016

Theoretical and computational results about optimality-based domain reductions.

[BibT_eX]

[DOI]

Marco Locatelli

Comput. Optim. Appl., 2016

On handling indicator constraints in mixed integer programming.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

Intersection Cuts for Bilevel Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

Models and algorithms for packing rectangles into the smallest square.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling.

[BibT_eX]

[DOI]

J. Intell. Transp. Syst., 2014

Exploiting Erraticism in Search.

[BibT_eX]

[DOI]

Oper. Res., 2014

Proximity search for 0-1 mixed-integer convex programming.

[BibT_eX]

[DOI]

J. Heuristics, 2014

Self-splitting of Workload in Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013

On the Robust Knapsack Problem.

[BibT_eX]

[DOI]

Ulrich Pferschy

SIAM J. Optim., 2013

Backdoor Branching.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

Exact solution of the robust knapsack problem.

[BibT_eX]

[DOI]

Ulrich Pferschy

Paolo Serafini

Comput. Oper. Res., 2013

2012

Branching on nonchimerical fractionalities.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

Complexity and approximation of an area packing problem.

[BibT_eX]

[DOI]

Optim. Lett., 2012

Cutting plane versus compact formulations for uncertain (integer) linear programs.

[BibT_eX]

[DOI]

Math. Program. Comput., 2012

Three Ideas for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Oper. Res., 2012

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.

[BibT_eX]

[DOI]

J. Heuristics, 2012

Exact algorithms for the two-dimensional guillotine knapsack.

[BibT_eX]

[DOI]

Mohammad Dolatabadi

Comput. Oper. Res., 2012

2011

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.

[BibT_eX]

[DOI]

Manag. Sci., 2011

An exact approach for the Vertex Coloring Problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.

[BibT_eX]

[DOI]

Comput. Networks, 2011

2010

An approximation scheme for the two-stage, two-dimensional knapsack problem.

[BibT_eX]

[DOI]

Discret. Optim., 2010

2009

Light Robustness.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Bidimensional packing by bilinear programming.

[BibT_eX]

[DOI]

Math. Program., 2009

Models and heuristic algorithms for a weighted vertex coloring problem.

[BibT_eX]

[DOI]

J. Heuristics, 2009

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem.

[BibT_eX]

[DOI]

Maria Battarra

Daniele Vigo

Comput. Oper. Res., 2009

2008

A Metaheuristic Approach for the Vertex Coloring Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

How tight is the corner relaxation?

[BibT_eX]

[DOI]

Discret. Optim., 2008

2007

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Transp. Sci., 2007

Chapter 3 Passenger Railway Optimization.

[BibT_eX]

[DOI]

Proceedings of the Transportation, 2007

2006

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2006

Lower bounds and heuristic algorithms for the k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Packing into the smallest square: Worst-case analysis of lower bounds.

[BibT_eX]

[DOI]

Discret. Optim., 2006

A Lagrangian heuristic algorithm for a real-world train timetabling problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2005

Bidimensional Packing by Bilinear Programming.

[BibT_eX]

[DOI]

Marco Locatelli

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

On the two-dimensional Knapsack Problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

2003

Integer linear programming models for 2-staged two-dimensional Knapsack problems.

[BibT_eX]

[DOI]

Math. Program., 2003

Models and algorithms for a staff scheduling problem.

[BibT_eX]

[DOI]

Math. Program., 2003

An Exact Approach to the Strip-Packing Problem.

[BibT_eX]

[DOI]

Daniele Vigo

INFORMS J. Comput., 2003

Algorithms for packing and scheduling problems.

[BibT_eX]

[DOI]

4OR, 2003

2002

Two-dimensional packing problems: A survey.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.

[BibT_eX]

[DOI]