| Publication | Date of Publication | Type |
|---|
Three network design problems for community energy storage
Networks | 2025-01-08 | Paper |
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
New formulations for two location problems with interconnected facilities
European Journal of Operational Research | 2024-04-16 | Paper |
Two extended formulations for the virtual network function placement and routing problem
Networks | 2023-12-18 | Paper |
Solving Steiner trees: Recent advances, challenges, and perspectives
Networks | 2023-12-11 | Paper |
Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
Mathematical Programming Computation | 2023-12-02 | Paper |
A survey on bilevel optimization under uncertainty
European Journal of Operational Research | 2023-09-15 | Paper |
A survey on mixed-integer programming techniques in bilevel optimization
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
Mathematical programming formulations for the collapsed k-core problem
European Journal of Operational Research | 2023-07-11 | Paper |
An exact method for binary fortification games
European Journal of Operational Research | 2023-07-10 | Paper |
| A bilevel approach for compensation and routing decisions in last-mile delivery | 2023-04-18 | Paper |
| A Brief Introduction to Robust Bilevel Optimization | 2022-11-29 | 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 |
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Operations Research | 2022-09-19 | Paper |
Comparison of formulations for the inventory routing problem
European Journal of Operational Research | 2022-08-03 | Paper |
Benders decomposition for a node-capacitated virtual network function placement and routing problem
Computers & Operations Research | 2022-03-07 | Paper |
| Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs | 2022-03-01 | Paper |
A tailored Benders decomposition approach for last-mile delivery with autonomous robots
European Journal of Operational Research | 2022-02-23 | Paper |
A branch-and-cut algorithm for the edge interdiction clique problem
European Journal of Operational Research | 2021-06-08 | Paper |
An exact method for assortment optimization under the nested logit model
European Journal of Operational Research | 2021-06-07 | Paper |
The generalized reserve set covering problem with connectivity and buffer requirements
European Journal of Operational Research | 2021-06-03 | Paper |
Interdiction Games and Monotonicity, with Application to Knapsack Problems
INFORMS Journal on Computing | 2020-12-03 | Paper |
Exact approaches for network design problems with relays
INFORMS Journal on Computing | 2020-12-02 | Paper |
A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
INFORMS Journal on Computing | 2020-11-09 | Paper |
A polyhedral study of the diameter constrained minimum spanning tree problem
Discrete Applied Mathematics | 2020-08-31 | Paper |
On integer and bilevel formulations for the \(k\)-vertex cut problem
Mathematical Programming Computation | 2020-08-27 | Paper |
The incremental connected facility location problem
Computers & Operations Research | 2019-10-18 | Paper |
Obtaining Optimalk-Cardinality Trees Fast
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
European Journal of Operational Research | 2019-06-25 | Paper |
The maximum clique interdiction problem
European Journal of Operational Research | 2019-03-28 | Paper |
Benders decomposition for very large scale partial set covering and maximal covering location problems
European Journal of Operational Research | 2019-02-11 | Paper |
On the use of intersection cuts for bilevel optimization
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
A node-based ILP formulation for the node-weighted dominating Steiner problem
Networks | 2018-06-13 | Paper |
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
European Journal of Operational Research | 2018-05-30 | Paper |
An algorithmic framework for the exact solution of tree-star problems
European Journal of Operational Research | 2018-05-29 | Paper |
Solving minimum-cost shared arborescence problems
European Journal of Operational Research | 2018-05-25 | Paper |
Stochastic survivable network design problems: theory and practice
European Journal of Operational Research | 2018-05-24 | Paper |
Decomposition methods for the two-stage stochastic Steiner tree problem
Computational Optimization and Applications | 2018-04-20 | Paper |
Thinning out Steiner trees: a node-based model for uniform edge costs
Mathematical Programming Computation | 2018-02-23 | Paper |
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
Mathematical Programming Computation | 2018-02-01 | Paper |
A new general-purpose algorithm for mixed-integer bilevel linear programs
Operations Research | 2018-01-11 | Paper |
The connected facility location polytope
Discrete Applied Mathematics | 2017-12-20 | Paper |
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
European Journal of Operational Research | 2017-12-06 | Paper |
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
Computers & Operations Research | 2016-11-17 | Paper |
Benders decomposition without separability: a computational study for capacitated facility location problems
European Journal of Operational Research | 2016-10-07 | Paper |
Intersection cuts for bilevel optimization
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
ILP and CP formulations for the lazy bureaucrat problem
Integration of AI and OR Techniques in Constraint Programming | 2016-07-25 | Paper |
Hop constrained Steiner trees with multiple root nodes
European Journal of Operational Research | 2016-06-23 | Paper |
The Generalized Regenerator Location Problem
INFORMS Journal on Computing | 2016-01-25 | Paper |
On the Asymmetric Connected Facility Location Polytope
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem
INFORMS Journal on Computing | 2015-09-11 | Paper |
The recoverable robust two-level network design problem
INFORMS Journal on Computing | 2015-09-11 | Paper |
Exact approaches for solving robust prize-collecting Steiner tree problems
European Journal of Operational Research | 2015-07-28 | Paper |
The Maximum Weight Connected Subgraph Problem
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
The two-level diameter constrained spanning tree problem
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
A MIP-based approach to solve the prize-collecting local access network design problem
European Journal of Operational Research | 2015-02-19 | Paper |
Lagrangian decompositions for the two-level FTTx network design problem
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
European Journal of Operational Research | 2014-07-27 | Paper |
Obtaining optimal \(k\)-cardinality trees fast
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
4OR | 2014-03-24 | Paper |
A cutting plane algorithm for the capacitated connected facility location problem
Computational Optimization and Applications | 2013-08-08 | Paper |
Variable neighborhood search for solving the balanced location problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
The rooted maximum node-weight connected subgraph problem
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2013-06-04 | Paper |
On the hop constrained Steiner tree problem with multiple root nodes
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Exact approaches to the single-source network loading problem
Networks | 2012-06-18 | Paper |
Modelling the hop constrained connected facility location problem on layered graphs
Mathematical Programming | 2012-05-13 | Paper |
MIP modeling of incremental connected facility location
Lecture Notes in Computer Science | 2011-09-09 | Paper |
The Two Level Network Design Problem with Secondary Hop Constraints
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A heuristic algorithm for a prize-collecting local access network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut
Algorithms and Computation | 2010-12-09 | Paper |
The regenerator location problem
Networks | 2010-11-24 | Paper |
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Networks | 2010-11-24 | Paper |
MIP models for connected facility location: a theoretical and computational study
Computers & Operations Research | 2010-10-15 | Paper |
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
The fractional prize-collecting Steiner tree problem on trees (extended abstract)
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Strong Formulations for 2-Node-Connected Steiner Network Problems
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
| scientific article; zbMATH DE number 2079893 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 1961997 (Why is no real title available?) | 2003-08-10 | Paper |
| scientific article; zbMATH DE number 1823835 (Why is no real title available?) | 2002-11-05 | Paper |
Solving the simple plant location problem by genetic algorithm
RAIRO. Operations Research | 2002-10-17 | Paper |
Solving the simple plant location problem by genetic algorithm
RAIRO. Operations Research | 2002-10-17 | Paper |
Evolutionary local search for the edge-biconnectivity augmentation problem
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1703848 (Why is no real title available?) | 2002-02-13 | Paper |
Operational Research: Methods and Applications
(available as arXiv preprint) | N/A | Paper |
Three Network Design Problems for Community Energy Storage
(available as arXiv preprint) | N/A | Paper |
Emerging Optimization Problems for Distribution in Same-day Delivery
(available as arXiv preprint) | N/A | Paper |
