UB Paderborn / Katalog / Suche / in CDI

Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings

1st Edition 2016, 2016

Link zum Volltext

Verfügbarkeit prüfen

Exact Methods for the Traveling Salesman Problem with Drone

Transportation science, 2021-03, Vol.55 (2), p.315-335

2021

Link zum Volltext

Verfügbarkeit prüfen

Load-dependent and precedence-based models for pickup and delivery problems

Computers & operations research, 2015-11, Vol.63, p.56-71

2015

Link zum Volltext

Verfügbarkeit prüfen

Large-scale influence maximization via maximal covering location

European journal of operational research, 2021-02, Vol.289 (1), p.144-164

2021

Link zum Volltext

Verfügbarkeit prüfen

Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm

Transportation science, 2023-03, Vol.57 (2), p.512-530

2023

Link zum Volltext

Verfügbarkeit prüfen

Layered graph approaches for combinatorial optimization problems

Computers & operations research, 2019-02, Vol.102, p.22-38

2019

Link zum Volltext

Verfügbarkeit prüfen

Optimizing charging station locations for urban taxi providers

Transportation research. Part A, Policy and practice, 2016-03, Vol.85, p.233-246

2016

Link zum Volltext

Verfügbarkeit prüfen

Benders decomposition for competitive influence maximization in (social) networks

Omega (Oxford), 2021-04, Vol.100, p.102264, Article 102264

2021

Link zum Volltext

Verfügbarkeit prüfen

Sensitivity analysis for energy demand estimation of electric vehicles

Transportation research. Part D, Transport and environment, 2016-07, Vol.46, p.182-199

2016

Link zum Volltext

Verfügbarkeit prüfen

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem

European journal of operational research, 2017-11, Vol.262 (3), p.908-928

2017

Link zum Volltext

Verfügbarkeit prüfen

Least cost influence propagation in (social) networks

Mathematical programming, 2018-07, Vol.170 (1), p.293-325

2018

Link zum Volltext

Verfügbarkeit prüfen

Corrigendum to “Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem” [European Journal of Operational Research, 262(3) 2017, 908–928]

European journal of operational research, 2020-09, Vol.285 (3), p.1199-1203

2020

Link zum Volltext

Verfügbarkeit prüfen

Exact approaches for the directed network design problem with relays

Omega (Oxford), 2020-03, Vol.91, p.102005, Article 102005

2020

Link zum Volltext

Verfügbarkeit prüfen

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption

Transportation science, 2022-09, Vol.56 (5), p.1219-1237

2022

Link zum Volltext

Verfügbarkeit prüfen

Modeling the first train timetabling problem with minimal missed trains and synchronization time differences in subway networks

Transportation research. Part B: methodological, 2016-11, Vol.93, p.17-36

2016

Link zum Volltext

Verfügbarkeit prüfen

Analysis of Schedules for Rural First and Last Mile Microtransit Services

Computational Logistics, p.332-346

Link zum Volltext

Verfügbarkeit prüfen

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem

Networks, 2018-06, Vol.71 (4), p.451-465

2018

Link zum Volltext

Verfügbarkeit prüfen

Exact Approaches for Network Design Problems with Relays

INFORMS journal on computing, 2019-01, Vol.31 (1), p.171-192

2019

Link zum Volltext

Verfügbarkeit prüfen

Bi-objective orienteering for personal activity scheduling

Computers & operations research, 2017-06, Vol.82, p.69-82

2017

Link zum Volltext

Verfügbarkeit prüfen

A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem

Evolutionary Computation in Combinatorial Optimization, 2015, p.36-47

2015

Link zum Volltext

Verfügbarkeit prüfen

Overview of Optimization Problems in Electric Car-Sharing System Design and Management

Dynamic Perspectives on Managerial Decision Making, 2016, p.441-471

2016

Link zum Volltext

Verfügbarkeit prüfen

Stabilizing branch-and-price for constrained tree problems

Networks, 2013-03, Vol.61 (2), p.150-170

2013

Link zum Volltext

Verfügbarkeit prüfen

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

Integer Programming and Combinatoral Optimization, p.376-388

Link zum Volltext

Verfügbarkeit prüfen

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Computer Aided Systems Theory – EUROCAST 2011, p.351-358

Link zum Volltext

Verfügbarkeit prüfen

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Parallel Problem Solving from Nature, PPSN XI, p.391-400

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings

Exact Methods for the Traveling Salesman Problem with Drone

Load-dependent and precedence-based models for pickup and delivery problems

Large-scale influence maximization via maximal covering location

Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm

Layered graph approaches for combinatorial optimization problems

Optimizing charging station locations for urban taxi providers

Benders decomposition for competitive influence maximization in (social) networks

Sensitivity analysis for energy demand estimation of electric vehicles

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem

Least cost influence propagation in (social) networks

Corrigendum to “Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem” [European Journal of Operational Research, 262(3) 2017, 908–928]

Exact approaches for the directed network design problem with relays

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption

Modeling the first train timetabling problem with minimal missed trains and synchronization time differences in subway networks

Analysis of Schedules for Rural First and Last Mile Microtransit Services

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem

Exact Approaches for Network Design Problems with Relays

Bi-objective orienteering for personal activity scheduling

A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem

Overview of Optimization Problems in Electric Car-Sharing System Design and Management

Stabilizing branch-and-price for constrained tree problems

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Suchergebnisse filtern