Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2023
Learning for Spatial Branching: An Algorithm Selection Approach
- Bissan Ghaddar,
- Ignacio Gómez-Casares,
- Julio González-Díaz,
- Brais González-Rodríguez,
- Beatriz Pateiro-López,
- Sofía Rodríguez-Ballesteros
INFORMS Journal on Computing (INFORMS-IJOC), Volume 35, Issue 5Pages 1024–1043https://doi.org/10.1287/ijoc.2022.0090The use of machine learning techniques to improve the performance of branch-and-bound optimization algorithms is a very active area in the context of mixed integer linear problems, but little has been done for nonlinear optimization. To bridge this gap, ...
- articleAugust 2018
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
INFORMS Journal on Computing (INFORMS-IJOC), Volume 30, Issue 3Pages 554–569https://doi.org/10.1287/ijoc.2017.0800This paper addresses a generalization of the vehicle routing problem in which the pick-up locations of the targets are nonstationary. We refer to this problem as the vehicle routing problem with floating targets and the main characteristic is that ...
- research-articleApril 2018
Efficient placement of edge computing devices for vehicular applications in smart cities
NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management SymposiumPages 1–9https://doi.org/10.1109/NOMS.2018.8406256Vehicular applications in smart cities, including assisted and autonomous driving, require complex data processing and low-latency communication. An effective approach to address these demands is to leverage the edge computing paradigm, wherein processing ...
- articleMarch 2016
A dynamic inequality generation scheme for polynomial programming
Mathematical Programming: Series A and B (MPRG), Volume 156, Issue 1-2Pages 21–57https://doi.org/10.1007/s10107-015-0870-9Hierarchies of semidefinite programs have been used to approximate or even solve polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small size. In this paper, we propose a dynamic ...
- ArticleSeptember 2015
Social or Green? A Data-Driven Approach for More Enjoyable Carpooling
ITSC '15: Proceedings of the 2015 IEEE 18th International Conference on Intelligent Transportation SystemsPages 842–847https://doi.org/10.1109/ITSC.2015.142Carpooling, i.e. the sharing of vehicles to reach common destinations, is often performed to reduce costs and pollution. Recent works on carpooling and journey planning take into account, besides mobility match, also social aspects and, more generally, ...
- ArticleJune 2011
An iterative scheme for valid polynomial inequality generation in binary polynomial programming
IPCO'11: Proceedings of the 15th international conference on Integer programming and combinatoral optimizationPages 207–222Semidefinite programming has been used successfully to build hierarchies of convex relaxations to approximate polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small sizes. We ...
- articleMarch 2011
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
SIAM Journal on Optimization (SIOPT), Volume 21, Issue 1Pages 391–414https://doi.org/10.1137/100802190Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, second-order cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic ...
- articleNovember 2006
A simple recursive scheme for adjusting the contention window size in IEEE 802.11e wireless ad hoc networks
Computer Communications (COMS), Volume 29, Issue 18Pages 3789–3803https://doi.org/10.1016/j.comcom.2006.06.016The IEEE 802.11e standard has been introduced recently for providing Quality of Service (QoS) capabilities in the emerging wireless local area networks. This standard introduces a contention window based Enhanced Distributed Channel Access (EDCA) ...