380.256 PEOPLE
| People | Locations | Statistics |
|---|---|---|
| Seuring, Stefan |
| |
| Nor Azizi, S. |
| |
| Pato, Margarida Vaz |
| |
| Kölker, Katrin |
| |
| Huber, Oliver |
| |
| Király, Tamás |
| |
| Spengler, Thomas Stefan |
| |
| Al-Ammar, Essam A. |
| |
| Dargahi, Fatemeh |
| |
| Mota, Rui |
| |
| Mazalan, Nurul Aliah Amirah |
| |
| Macharis, Cathy | Brussels |
|
| Arunasari, Yova Tri |
| |
| Nunez, Alfredo | Delft |
|
| Bouhorma, Mohammed |
| |
| Bonato, Matteo |
| |
| Fitriani, Ira |
| |
| Autor Correspondente Coelho, Sílvia. |
| |
| Pond, Stephen |
| |
| Okwara, Ukoha Kalu |
| |
| Toufigh, Vahid |
| |
| Campisi, Tiziana | Enna |
|
| Ermolieva, Tatiana |
| |
| Sánchez-Cambronero, Santos |
| |
| Agzamov, Akhror |
|
Salazar-González, J.-J.
in Cooperation with on an Cooperation-Score of 37%
Topics
Publications (57/57 displayed)
- 2018The driver and vehicle routing problemcitations
- 2017Optimal solutions to a real-world integrated airline scheduling problemcitations
- 2017An exact algorithm for a Vehicle-and-Driver Scheduling Problemcitations
- 2016Hierarchical Survivable Network Design Problemscitations
- 2016Solving the single vehicle routing problem with variable capacitycitations
- 2016The ring/κ-rings network design problem: Model and branch-and-cut algorithmcitations
- 2016A branch-and-cut algorithm for two-level survivable network design problemscitations
- 2015Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problemcitations
- 2015The split-demand one-commodity pickup-and-delivery travelling salesman problemcitations
- 2015Preface
- 2014Enhanced controlled tabular adjustmentcitations
- 2014On the asymmetric connected facility location polytopecitations
- 2014Further developments with perturbation techniques to protect tabular datacitations
- 2014A branch-and-cut algorithm for the hub location and routing problemcitations
- 2013A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problemcitations
- 2013International network optimization conference, Tenerife 2013
- 2013Polynomial-time separation of Enhanced Reverse Multistar inequalitiescitations
- 2013Models and heuristics algorithmfor an integrated fleet-assignment, aircraft-routing and crew-pairing problem
- 2013The multi-commodity pickup-and-delivery traveling salesman problemcitations
- 2013Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per routecitations
- 2012The multi-commodity one-to-one pickup-and-delivery traveling salesman problem with path duration limits
- 2012The balanced minimum evolution problemcitations
- 2012Exact approaches to the single-source network loading problemcitations
- 2012Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approachcitations
- 2011Generalized network design polyhedracitations
- 2011A heuristic algorithm for a prize-collecting local access network design problemcitations
- 2011Decorous lower bounds for minimum linear arrangementcitations
- 2010Branch-and-cut versus cut-and-branch algorithms for cell suppressioncitations
- 2010Lower bounds for the minimum linear arrangement of a graphcitations
- 2010Hybridization of very large neighborhood search for ready-mixed concrete delivery problemscitations
- 2010On the vehicle routing problem with lower bound capacitiescitations
- 2009Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterioncitations
- 2009The multi-commodity one-to-one pickup-and-delivery traveling salesman problemcitations
- 2009On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demandscitations
- 2008A new approach for data editing and imputation
- 2008Statistical confidentiality: Optimization techniques to protect tablescitations
- 2007An exact approach for the vehicle routing problem with two-dimensional loading constraintscitations
- 2007A branch-and-cut algorithm for the continuous error localization problem in data cleaningcitations
- 2007A heuristic approach for the continuous error localization problem in data cleaningcitations
- 2007The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithmscitations
- 2006Controlled rounding and cell perturbation: Statistical disclosure limitation methods for tabular datacitations
- 2006Projection results for vehicle routingcitations
- 2006An iterated local search heuristic for a capacitated hub location problemcitations
- 2005A unified mathematical programming framework for different statistical disclosure limitation methodscitations
- 2005Laying out sparse graphs with provably minimum bandwidthcitations
- 2004A branch-and-cut algorithm for a traveling salesman problem with pickup and deliverycitations
- 2004Decomposition approaches for a capacitated hub problemcitations
- 2004Mathematical models for applying cell suppression methodology in statistical data protectioncitations
- 2004Heuristics for the one-commodity pickup-and-delivery traveling salesman problemcitations
- 2004A new tool for applying controlled rounding to a statistical table in Microsoft Excel
- 2004Getting the best results in controlled rounding with the least effortcitations
- 2003Algorithms for automatic data editing
- 2003Partial cell suppression: A new methodology for statistical disclosure controlcitations
- 2003A branch-and-cut algorithm for the undirected traveling purchaser problemcitations
- 2003The one-commodity pickup-and-delivery travelling salesman problemcitations
- 2003The Steiner cycle polytopecitations
- 2001Combining complete and partial cell suppression methodologies in statistical disclosure control
Places of action
| Organizations | Location | People |
|---|