UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 507

Sortiert nach

A branch-and-cut algorithm for the hub location and routing problem

Computers & operations research, 2014-10, Vol.50, p.161-174

2014

Volltextzugriff (PDF)

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach

Computers & operations research, 2012-02, Vol.39 (2), p.391-404

2012

Volltextzugriff (PDF)

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation science, 2007-05, Vol.41 (2), p.253-264

2007

Volltextzugriff (PDF)

An algorithmic framework for the exact solution of tree-star problems

European journal of operational research, 2017-08, Vol.261 (1), p.54-66

2017

Volltextzugriff (PDF)

The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach

European journal of operational research, 2021-03, Vol.289 (2), p.470-484

2021

Volltextzugriff (PDF)

Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier

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

2020

Volltextzugriff (PDF)

The periodic vehicle routing problem with driver consistency

European journal of operational research, 2019-03, Vol.273 (2), p.575-584

2019

Volltextzugriff (PDF)

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time

European journal of operational research, 2019-01, Vol.272 (1), p.24-31

2019

Volltextzugriff (PDF)

Mathematical formulations for consistent travelling salesman problems

European journal of operational research, 2024-03, Vol.313 (2), p.465-477

2024

Volltextzugriff (PDF)

A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

European journal of operational research, 2022-03, Vol.297 (2), p.467-483

2022

Volltextzugriff (PDF)

Optimal Solutions to a Real-World Integrated Airline Scheduling Problem

Transportation science, 2017-02, Vol.51 (1), p.250-268

2017

Volltextzugriff (PDF)

The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

European journal of operational research, 2009-08, Vol.196 (3), p.987-995

2009

Volltextzugriff (PDF)

The multi-commodity pickup-and-delivery traveling salesman problem

Networks, 2014-01, Vol.63 (1), p.46-59

2014

Volltextzugriff (PDF)

A local branching heuristic for the capacitated fixed-charge network design problem

Computers & operations research, 2010-03, Vol.37 (3), p.575-581

2010

Volltextzugriff (PDF)

Designing optimal masks for a multi-object spectrometer

Omega (Oxford), 2021-09, Vol.103, p.102392, Article 102392

Salazar-González, Juan-José

2021

Volltextzugriff (PDF)

Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier

Omega (Oxford), 2014-03, Vol.43, p.71-82

Salazar-González, Juan-José

2014

Volltextzugriff (PDF)

Selective routing problem with synchronization

Computers & operations research, 2021-11, Vol.135, p.105465, Article 105465

2021

Volltextzugriff (PDF)

Tool switching problems with tool order constraints

Discrete Applied Mathematics, 2024-04, Vol.347, p.249-262

2024

Volltextzugriff (PDF)

The ring/κ-rings network design problem: Model and branch-and-cut algorithm

Networks, 2016-09, Vol.68 (2), p.130-140

2016

Volltextzugriff (PDF)

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

Transportation science, 2021-01, Vol.55 (1), p.122-138

2021

Volltextzugriff (PDF)

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

European journal of operational research, 2015-08, Vol.244 (3), p.730-738

2015

Volltextzugriff (PDF)

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Networks, 2010-01, Vol.55 (1), p.46-59

2010

Volltextzugriff (PDF)

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

Networks, 2013-07, Vol.61 (4), p.309-321

2013

Volltextzugriff (PDF)

The split-demand one-commodity pickup-and-delivery travelling salesman problem

Transportation research. Part B: methodological, 2015-05, Vol.75, p.58-73

2015

Volltextzugriff (PDF)

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm

European journal of operational research, 2019-03, Vol.273 (2), p.452-463

2019

Volltextzugriff (PDF)

1 – 25 von 507

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(363)
Mit Volltextzugriff
(478)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

2 weitere anzeigen...

Weniger anzeigen...

Erscheinungsjahr

n.n

Thema

Science & Technology
(216)
Life Sciences & Biomedicine
(112)
Technology
(93)
Humans
(83)
Operations Research & Management Science
(73)
Computer Science
(62)
Male
(53)
Female
(50)
Studies
(48)
Middle Aged
(40)
Exact Sciences And Technology
(39)
Applied Sciences
(38)
Adult
(36)
Algorithms
(32)
Social Sciences
(30)
Management
(28)
Operational Research And Scientific Management
(28)
Operational Research. Management Science
(28)
Business & Economics
(27)
Integer Programming
(27)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(3)
... seit 90 Tagen
(78)

Menü

Weitere Dienste

Einstellungen

A branch-and-cut algorithm for the hub location and routing problem

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

An algorithmic framework for the exact solution of tree-star problems

The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach

Heuristic approaches for flight retiming in an integrated airline scheduling problem of a regional carrier

The periodic vehicle routing problem with driver consistency

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time

Mathematical formulations for consistent travelling salesman problems

A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

Optimal Solutions to a Real-World Integrated Airline Scheduling Problem

The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

The multi-commodity pickup-and-delivery traveling salesman problem

A local branching heuristic for the capacitated fixed-charge network design problem

Designing optimal masks for a multi-object spectrometer

Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier

Selective routing problem with synchronization

Tool switching problems with tool order constraints

The ring/κ-rings network design problem: Model and branch-and-cut algorithm

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

The split-demand one-commodity pickup-and-delivery travelling salesman problem

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm

Suchergebnisse filtern