| Publication | Date of Publication | Type |
|---|
Fare inspection patrolling under in-station selective inspection policy
Annals of Operations Research | 2024-09-03 | Paper |
Min–max optimization of node‐targeted attacks in service networks
Networks | 2024-03-15 | Paper |
Preprocessing for segment routing optimization
Networks | 2024-01-18 | Paper |
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
Networks | 2023-12-12 | Paper |
Fill‐rate service level constrained distribution network design
International Transactions in Operational Research | 2023-11-29 | Paper |
Loads scheduling for demand response in energy communities
Computers \& Operations Research | 2023-11-13 | Paper |
Strategic bidding in price coupled regions
Mathematical Methods of Operations Research | 2022-07-15 | Paper |
Benders decomposition for network design covering problems
Computers \& Operations Research | 2022-03-09 | Paper |
Benders decomposition for Network Design Covering Problems
| 2020-07-13 | Paper |
A study of general and security Stackelberg game formulations
European Journal of Operational Research | 2019-06-27 | Paper |
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
4OR | 2019-06-21 | Paper |
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
Networks | 2018-06-13 | Paper |
Models for the piecewise linear unsplittable multicommodity flow problems
European Journal of Operational Research | 2018-05-29 | Paper |
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
European Journal of Operational Research | 2018-05-24 | Paper |
Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
Discrete Applied Mathematics | 2017-12-20 | Paper |
Extended formulation for hop constrained distribution network configuration problems
European Journal of Operational Research | 2017-11-23 | Paper |
On the hop-constrained survivable network design problem with reliable edges
Computers \& Operations Research | 2016-11-17 | Paper |
Distributed monitoring problem
| 2016-10-18 | Paper |
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Intra-domain traffic engineering with shortest path routing protocols
Annals of Operations Research | 2013-08-08 | Paper |
A branch-and-cut algorithm for the ring spur assignment problem
Networks | 2013-08-06 | Paper |
Stochastic binary problems with simple penalties for capacity constraints violations
Mathematical Programming. Series A. Series B | 2013-05-06 | Paper |
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Networks | 2012-11-15 | Paper |
On the hazmat transport network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Improved formulations for the ring spur assignment problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Applications of meta-heuristics to traffic engineering in IP networks
International Transactions in Operational Research | 2011-08-17 | Paper |
Efficient techniques and tools for intra-domain traffic engineering
International Transactions in Operational Research | 2011-08-17 | Paper |
Easy distributions for combinatorial optimization problems with probabilistic constraints
Operations Research Letters | 2010-12-23 | Paper |
Intra-domain traffic engineering with shortest path routing protocols
4OR | 2010-06-16 | Paper |
Optimization of OSPF routing in IP networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
An improved Benders decomposition applied to a multi-layer network design problem
Operations Research Letters | 2009-11-17 | Paper |
Polyhedral approaches to the design of survivable networks
| 2007-07-23 | Paper |
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Increasing internet capacity using local search
Computational Optimization and Applications | 2005-01-17 | Paper |
Two-connected networks with rings of bounded cardinality
Computational Optimization and Applications | 2004-03-15 | Paper |
A tabu search algorithm for self-healing ring network design.
European Journal of Operational Research | 2003-10-14 | Paper |
scientific article; zbMATH DE number 1867329 (Why is no real title available?)
| 2003-02-11 | Paper |
Polyhedral results for two-connected networks with bounded rings
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
Solving the Two-Connected Network with Bounded Meshes Problem
Operations Research | 2002-06-04 | Paper |
scientific article; zbMATH DE number 1535630 (Why is no real title available?)
| 2000-11-26 | Paper |
Operational Research: Methods and Applications
| N/A | Paper |
