Ivana Ljubic

Eur. J. Oper. Res., April, 2024

Operational Research: methods and applications.

[BibT_eX]

[DOI]

Christine S. M. Currie

Harilaos N. Psaraftis

J. Oper. Res. Soc., March, 2024

Benders decomposition for congested partial set covering location with uncertain demand.

[BibT_eX]

[DOI]

Alice Calamita

Laura Palagi

CoRR, 2024

2023

Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem.

[BibT_eX]

[DOI]

Yasmine Beck

Martin Schmidt

Math. Program. Comput., December, 2023

A survey on bilevel optimization under uncertainty.

[BibT_eX]

[DOI]

Yasmine Beck

Martin Schmidt

Eur. J. Oper. Res., December, 2023

Mathematical programming formulations for the Collapsed k-Core Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., November, 2023

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs.

[BibT_eX]

[DOI]

Cristian Ramirez-Pico

Eduardo Moreno

Transp. Sci., September, 2023

Two extended formulations for the virtual network function placement and routing problem.

[BibT_eX]

[DOI]

Networks, July, 2023

An exact method for binary fortification games.

[BibT_eX]

[DOI]

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

2022

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.

[BibT_eX]

[DOI]

Transp. Sci., 2022

Budgeting in International Humanitarian Organizations.

[BibT_eX]

[DOI]

Milad Keshvari Fard

Felix Papier

Manuf. Serv. Oper. Manag., 2022

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems.

[BibT_eX]

[DOI]

Stefano Coniglio

Math. Program., 2022

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.

[BibT_eX]

[DOI]

Oper. Res., 2022

Comparison of formulations for the Inventory Routing Problem.

[BibT_eX]

[DOI]

Claudia Archetti

Eur. J. Oper. Res., 2022

A tailored Benders decomposition approach for last-mile delivery with autonomous robots.

[BibT_eX]

[DOI]

Laurent Alfandari

Marcos de Melo da Silva

Eur. J. Oper. Res., 2022

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

[BibT_eX]

[DOI]

CoRR, 2022

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.

[BibT_eX]

[DOI]

Yuanyuan Li

Claudia Archetti

CoRR, 2022

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots.

[BibT_eX]

Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021

Solving Steiner trees: Recent advances, challenges, and perspectives.

[BibT_eX]

[DOI]

Networks, 2021

A branch-and-cut algorithm for the Edge Interdiction Clique Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.

[BibT_eX]

[DOI]

Marcos Goycoolea

Eur. J. Oper. Res., 2021

An exact method for assortment optimization under the nested logit model.

[BibT_eX]

[DOI]

Laurent Alfandari

Alborz Hassanzadeh

Eur. J. Oper. Res., 2021

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2021

An Exact Method for Fortification Games.

[BibT_eX]

[DOI]

CoRR, 2021

Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

Location of Charging Stations in Electric Car Sharing Systems.

[BibT_eX]

[DOI]

Georg Brandstätter

Transp. Sci., 2020

On integer and bilevel formulations for the <i>k</i>-vertex cut problem.

[BibT_eX]

[DOI]

Math. Program. Comput., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.

[BibT_eX]

[DOI]

Luis Gouveia

Discret. Appl. Math., 2020

Preface: decomposition methods for hard optimization problems.

[BibT_eX]

[DOI]

Emiliano Traversi

Ann. Oper. Res., 2020

Virtual Network Functions Placement and Routing Problem: Path formulation.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

2019

Exact Approaches for Network Design Problems with Relays.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

Interdiction Games and Monotonicity, with Application to Knapsack Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

A new branch-and-bound algorithm for the maximum edge-weighted clique problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

The maximum clique interdiction problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Benders decomposition for very large scale partial set covering and maximal covering location problems.

[BibT_eX]

[DOI]

Jean-François Cordeau

Eur. J. Oper. Res., 2019

The incremental connected facility location problem.

[BibT_eX]

[DOI]

Ashwin Arulselvan

Andreas Bley

Comput. Oper. Res., 2019

2018

On the use of intersection cuts for bilevel optimization.

[BibT_eX]

[DOI]

Math. Program., 2018

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2018

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities.

[BibT_eX]

[DOI]

Eduardo Moreno

Eur. J. Oper. Res., 2018

The connected facility location polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

A node-based ILP formulation for the node-weighted dominating Steiner problem.

[BibT_eX]

[DOI]

Andreas Bley

Olaf Maurer

Networks, 2017

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

[BibT_eX]

[DOI]

Math. Program. Comput., 2017

Redesigning Benders Decomposition for Large-Scale Facility Location.

[BibT_eX]

[DOI]

Matteo Fischetti

Manag. Sci., 2017

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

[BibT_eX]

[DOI]

Oper. Res., 2017

Stochastic survivable network design problems: Theory and practice.

[BibT_eX]

[DOI]

Petra Mutzel

Bernd Zey

Eur. J. Oper. Res., 2017

An algorithmic framework for the exact solution of tree-star problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Feature cluster: Recent advances in exact methods for multi-objective optimisation.

[BibT_eX]

[DOI]

Matthias Ehrgott

Sophie N. Parragh

Eur. J. Oper. Res., 2017

Solving minimum-cost shared arborescence problems.

[BibT_eX]

[DOI]

Martin Luipersbeck

Eur. J. Oper. Res., 2017

2016

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

Benders decomposition without separability: A computational study for capacitated facility location problems.

[BibT_eX]

[DOI]

Matteo Fischetti

Eur. J. Oper. Res., 2016

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

Intersection Cuts for Bilevel Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

The two-level diameter constrained spanning tree problem.

[BibT_eX]

[DOI]

Math. Program., 2015

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2015

The Generalized Regenerator Location Problem.

[BibT_eX]

[DOI]

Si Chen

S. Raghavan

INFORMS J. Comput., 2015

The Recoverable Robust Two-Level Network Design Problem.

[BibT_eX]

[DOI]

S. Raghavan

INFORMS J. Comput., 2015

ILP and CP Formulations for the Lazy Bureaucrat Problem.

[BibT_eX]

[DOI]

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

2014

A MIP-based approach to solve the prize-collecting local access network design problem.

[BibT_eX]

[DOI]

Peter Putz

Eur. J. Oper. Res., 2014

Hop constrained Steiner trees with multiple root nodes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

On the Asymmetric Connected Facility Location Polytope.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

2013

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Exact approaches for solving robust prize-collecting Steiner tree problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Stochastic Survivable Network Design Problems.

[BibT_eX]

[DOI]

Petra Mutzel

Bernd Zey

Electron. Notes Discret. Math., 2013

On the Two-Architecture Connected Facility Location Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Lagrangian decompositions for the two-level FTTx network design problem.

[BibT_eX]

[DOI]

Andreas Bley

Olaf Maurer

EURO J. Comput. Optim., 2013

A cutting plane algorithm for the Capacitated Connected Facility Location Problem.

[BibT_eX]

[DOI]

Bernard Gendron

Comput. Optim. Appl., 2013

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.

[BibT_eX]

[DOI]

4OR, 2013

The Rooted Maximum Node-Weight Connected Subgraph Problem.

[BibT_eX]

[DOI]

Petra Mutzel

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

Exact approaches to the single-source network loading problem.

[BibT_eX]

[DOI]

Peter Putz

Networks, 2012

Variable Neighborhood Search for Solving the Balanced Location Problem.

[BibT_eX]

[DOI]

Jozef Kratica

Electron. Notes Discret. Math., 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

MIP models for connected facility location: A theoretical and computational study.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.

[BibT_eX]

[DOI]

Peter Putz

Proceedings of the Network Optimization - 5th International Conference, 2011

The Two Level Network Design Problem with Secondary Hop Constraints.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

MIP Modeling of Incremental Connected Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

Exact solutions for the robust prize-collecting steiner tree problem.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.

[BibT_eX]

[DOI]

Networks, 2010

The regenerator location problem.

[BibT_eX]

[DOI]

Si Chen

S. Raghavan

Networks, 2010

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.

[BibT_eX]

[DOI]

Math. Program., 2010

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Obtaining optimal <i>k</i>-cardinality trees fast.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

2008

A GRASP Algorithm for the Connected Facility Location Problem.

[BibT_eX]

[DOI]

Alessandro Tomazic

Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

Strong Formulations for 2-Node-Connected Steiner Network Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Obtaining Optimal k-Cardinality Trees Fast.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

A Hybrid VNS for Connected Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

2006

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Math. Program., 2006

2005

Solving the Prize-Collecting Steiner Tree Problem to Optimality.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2004

2003

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.

[BibT_eX]

[DOI]

J. Heuristics, 2003

A Genetic Algorithm for the Index Selection Problem.

[BibT_eX]

[DOI]

Jozef Kratica

Dusan Tosic

Proceedings of the Applications of Evolutionary Computing, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Evolutionary local search for the edge-biconnectivity augmentation problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

A Memetic Algorithm for Vertex-Biconnectivity Augmentation.

[BibT_eX]

[DOI]

Sandor Kersting

Proceedings of the Applications of Evolutionary Computing, 2002

2001

Solving the simple plant location problem by genetic algorithm.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2001

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2001

2000

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.

[BibT_eX]

[DOI]