467.600 PEOPLE
People | Locations | Statistics |
---|---|---|
Serhiienko, Serhii |
| |
Schmalz, Ulrike |
| |
Oliveira, Marisa |
| |
Ribeiro Pereira, Maria Teresa |
| |
Bellér, Gábor |
| |
Araujo, M. |
| |
Frey, Michael | Karlsruhe |
|
Coutinho-Rodrigues, João | Coimbra |
|
Wouters, Christian Guillaume Louise | Aachen |
|
Kessel, Paul J. Van Van |
| |
Árpád, István |
| |
Fontul, Simona |
| |
Kocsis, Dénes |
| |
Cigada, Alfredo | Milan |
|
Oort, Neils Van | Delft |
|
Agárdi, Anita | Miskolc |
|
Andrews, Gordon E. |
| |
Sousa, Nuno |
| |
Witlox, Frank Jacomina Albert | Ghent |
|
Dobruszkes, Frederic |
| |
Kiss, Judit T. |
| |
Hadachi, Amnir | Saint-Étienne-du-Rouvray |
|
Hamilton, Carl J. | Kunovice |
|
Misiura, Serhii |
| |
Schimpf, Marina |
|
Salazar Gonzalez, Juan Jose'
University of La Laguna
in Cooperation with on an Cooperation-Score of 37%
Topics
- traveling salesman problem
- commodity
- algorithm
- laceration
- spectrometer
- price
- vehicle
- routing
- constraint
- bottleneck
- aircraft
- variable
- train consist
- flight
- costs
- maintenance
- vehicle fleet
- employed
- island
- departure time
- scheduling
- parametric analysis
- sensitivity analysis
- sensitivity
- heuristic algorithm
- linear programming
- crew scheduling
- regional airline
- driver
- tree
- wayfinding
- airline
- waiting time
- planning method
- design
- commodity flow
- data
- infrastructure
- port
- liner shipping
- perturbation
- hub
- customer
- school
- school bus
- optimisation
- evolution
- fee
- graph
- neighborhood
- ready mixed concrete
- mathematical model
- cleaning
- intersection
- forecasting
- protection
- data protection
- plant
- occupation
- sequencing
- decomposition
- assembly line
- telephone
- radio equipment
- mobile telephone
- show 35 more
Publications
- 2022The Biobjective Consistent Traveling Salesman Problem
- 2022Tool Switching Problems in the Context of Overlay Printing with Multiple Colourscitations
- 2022A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problemcitations
- 2021Designing optimal masks for a multi-object spectrometercitations
- 2021A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraintscitations
- 2020Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carriercitations
- 2019The periodic vehicle routing problem with driver consistencycitations
- 2019The probabilistic pickup-and-delivery travelling salesman problemcitations
- 2019The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial timecitations
- 2019Optimal Solutions for the Vehicle Routing Problem with Split Demandscitations
- 2019Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithmcitations
- 2018The driver and vehicle routing problemcitations
- 2018A Heuristic Approach to the Driver and Vehicle Routing Problemcitations
- 2018The connected facility location polytopecitations
- 2018An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problemcitations
- 2018Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problemcitations
- 2018Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returnscitations
- 2017An algorithmic framework for the exact solution of tree-star problemscitations
- 2017Solving the Team Orienteering Arc Routing Problem with a column generation approachcitations
- 2017An exact algorithm for a Vehicle-and-Driver Scheduling Problemcitations
- 2017Optimal solutions to a real-world integrated airline scheduling problemcitations
- 2016A branch-and-cut algorithm for two-level survivable network design problemscitations
- 2016Hierarchical Survivable Network Design Problemscitations
- 2016The ring/κ-rings network design problem: Model and branch-and-cut algorithmcitations
- 2016Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problemcitations
- 2016Solving the single vehicle routing problem with variable capacitycitations
- 2016A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problemcitations
- 2016Preface
- 2015The split-demand one-commodity pickup-and-delivery travelling salesman problemcitations
- 2015Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problemcitations
- 2015Preface
- 2014A MIP-based approach to solve the prize-collecting local access network design problemcitations
- 2014Chapter 7: Pickup-and-Delivery Problems for People Transportationcitations
- 2014Measuring cost efficiency in the presence of quasi-fixed inputs using dynamic Data Envelopment Analysis: The case of port infrastructurecitations
- 2014Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carriercitations
- 2014Pickup-and-Delivery Problems for People Transportation
- 2014On the asymmetric connected facility location polytopecitations
- 2014Single liner shipping service designcitations
- 2014Further developments with perturbation techniques to protect tabular datacitations
- 2014Enhanced controlled tabular adjustmentcitations
- 2014A branch-and-cut algorithm for the hub location and routing problemcitations
- 2013The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approachcitations
- 2013The multi-commodity pickup-and-delivery traveling salesman problemcitations
- 2013A column generation approach for a school bus routing problem with resource constraintscitations
- 2013Polynomial-time separation of Enhanced Reverse Multistar inequalitiescitations
- 2013Models and heuristics algorithmfor an integrated fleet-assignment, aircraft-routing and crew-pairing problem
- 2013International network optimization conference, Tenerife 2013
- 2013A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing 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
- 2012A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman 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
- 2011Decorous lower bounds for minimum linear arrangementcitations
- 2011A heuristic algorithm for a prize-collecting local access network design problemcitations
- 2011Statistical Confidentiality: Principles and Practicecitations
- 2011Generalized network design polyhedracitations
- 2011The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristiccitations
- 2010A local branching heuristic for the capacitated fixed-charge network design problemcitations
- 2010Branch-and-cut versus cut-and-branch algorithms for cell suppressioncitations
- 2010A branch-and-cut algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO loadingcitations
- 2010On the vehicle routing problem with lower bound capacitiescitations
- 2010Lower bounds for the minimum linear arrangement of a graphcitations
- 2010Comments on: Routing problems with loading constraints
- 2010Hybridization of very large neighborhood search for ready-mixed concrete delivery problemscitations
- 2009On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demandscitations
- 2009The multi-commodity one-to-one pickup-and-delivery traveling salesman problemcitations
- 2009A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problemcitations
- 2009Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterioncitations
- 2008A new approach for data editing and imputation
- 2008Statistical confidentiality: Optimization techniques to protect tablescitations
- 2008Solving a capacitated hub location problemcitations
- 2008A New Lower Bound for the Minimum Linear Arrangement of a Graphcitations
- 2007A branch-and-cut algorithm for the continuous error localization problem in data cleaningcitations
- 2007The Generalized Traveling Salesman and Orienteering Problemscitations
- 2007A heuristic approach for the continuous error localization problem in data cleaningcitations
- 2007An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersectioncitations
- 2007An exact approach for the vehicle routing problem with two-dimensional loading constraintscitations
- 2007The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithmscitations
- 2006A new approach to round tabular datacitations
- 2006Controlled rounding and cell perturbation: Statistical disclosure limitation methods for tabular datacitations
- 2006Solving the asymmetric traveling purchaser problemcitations
- 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
- 2005The biobjective travelling purchaser problemcitations
- 2005A heuristic approach for the Travelling Purchaser Problemcitations
- 2005Laying out sparse graphs with provably minimum bandwidthcitations
- 2005Locating median cycles in networkscitations
- 2004A branch-and-cut algorithm for a traveling salesman problem with pickup and deliverycitations
- 2004Heuristics for the one-commodity pickup-and-delivery traveling salesman problemcitations
- 2004Mathematical models for applying cell suppression methodology in statistical data protectioncitations
- 2004A branch-and-cut algorithm for the plant-cycle location problemcitations
- 2004The ring star problem: Polyhedral analysis and exact algorithmcitations
- 2004Exact algorithms for the job sequencing and tool switching problemcitations
- 2004Decomposition approaches for a capacitated hub problemcitations
- 2004Getting the best results in controlled rounding with the least effortcitations
- 2004Heuristic for balancing a simple assembly line (SALBP, type-1 problem) | Heurístico para balancear una línea de ensamblaje simple (SALBP, problema tipo-1)
- 2004A new tool for applying controlled rounding to a statistical table in Microsoft Excel
- 2003Optimisation of the interconnecting network of a UMTS radio mobile telephone systemcitations
- 2003Some Recent Contributions to Routing and Location Problemscitations
- 2003Algorithms for automatic data editing
- 2003Partial cell suppression: A new methodology for statistical disclosure controlcitations
- 2003The Steiner cycle polytopecitations
- 2003The one-commodity pickup-and-delivery travelling salesman problemcitations
- 2003A branch-and-cut algorithm for the undirected traveling purchaser problemcitations
- 2002Extending Cell Suppression to Protect Tabular Data against Several Attackerscitations
- 2001Solving the Cell Suppression Problem on tabular data with linear constraintscitations
- 2001Combining complete and partial cell suppression methodologies in statistical disclosure control
- 2000A note on the generalized steiner tree polytopecitations
- 2000Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints
Places of action