| Publication | Date of Publication | Type |
|---|
An exact method for (constrained) assortment optimization problems with product costs
INFORMS Journal on Computing | 2024-07-29 | Paper |
An exact method for binary fortification games
European Journal of Operational Research | 2023-07-10 | Paper |
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs
| 2021-09-07 | Paper |
Large-scale influence maximization via maximal covering location
European Journal of Operational Research | 2021-06-03 | Paper |
Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
Mathematics of Operations Research | 2021-06-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 |
Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
European Journal of Operational Research | 2020-05-27 | Paper |
Layered graph approaches for combinatorial optimization problems
Computers \& Operations Research | 2018-12-03 | Paper |
Least cost influence propagation in (social) networks
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
A Benders decomposition based framework for solving cable trench problems
Computers \& Operations Research | 2018-07-11 | Paper |
Branch-and-cut methods for the network design problem with vulnerability constraints
Computers \& Operations Research | 2018-07-11 | Paper |
An algorithmic framework for the exact solution of tree-star problems
European Journal of Operational Research | 2018-05-29 | 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 |
Design of survivable networks with vulnerability constraints
European Journal of Operational Research | 2018-02-16 | Paper |
The connected facility location polytope
Discrete Applied Mathematics | 2017-12-20 | Paper |
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
European Journal of Operational Research | 2017-12-06 | Paper |
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
Computers \& Operations Research | 2016-11-17 | 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 |
Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
Computational Optimization and Applications | 2016-09-26 | Paper |
Hop constrained Steiner trees with multiple root nodes
European Journal of Operational Research | 2016-06-23 | 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 two-level diameter constrained spanning tree problem
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Stabilizing branch-and-price for constrained tree problems
Networks | 2013-08-06 | Paper |
Variable neighborhood search for solving the balanced location problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On the hop constrained Steiner tree problem with multiple root nodes
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Strong lower bounds for a survivable network design problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Branch-and-cut-and-price for capacitated connected facility location
JMMA. Journal of Mathematical Modelling and Algorithms | 2012-02-21 | Paper |
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
Networks | 2010-11-24 | Paper |
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
Journal of Heuristics | 2008-11-17 | Paper |
The role of individual compensation and acceptance decisions in crowdsourced delivery
| N/A | Paper |
