UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A new branch-and-cut approach for the generalized regenerator location problem

Annals of operations research, 2020-12, Vol.295 (1), p.229-255

2020

Volltextzugriff (PDF)

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

European journal of operational research, 2017-02, Vol.257 (1), p.25-40

2017

Volltextzugriff (PDF)

An ant colony optimization metaheuristic for machine–part cell formation problems

Computers & operations research, 2010-12, Vol.37 (12), p.2071-2081

2010

Volltextzugriff (PDF)

Matheuristics for the single-path design-balanced service network design problem

Computers & operations research, 2017-01, Vol.77, p.141-153

2017

Volltextzugriff (PDF)

An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem

Transportation research. Part E, Logistics and transportation review, 2010-11, Vol.46 (6), p.1111-1127

2010

Volltextzugriff (PDF)

Supply regulation under the exclusion policy in a ride-sourcing market

Transportation research. Part B: methodological, 2022-12, Vol.166, p.69-94

2022

Volltextzugriff (PDF)

Integrating order delivery and return operations for order fulfillment in an online retail environment

Computers & operations research, 2022-07, Vol.143, p.105749, Article 105749

2022

Volltextzugriff (PDF)

Integrated order allocation and order routing problem for e-order fulfillment

IIE transactions, 2019-10, Vol.51 (10), p.1128-1150

2019

Volltextzugriff (PDF)

Single-path service network design problem with resource constraints

Transportation research. Part E, Logistics and transportation review, 2020-08, Vol.140, p.101945, Article 101945

2020

Volltextzugriff (PDF)

Directed fixed charge multicommodity network design: A cutting plane approach using polar duality

European journal of operational research, 2022-05, Vol.299 (1), p.118-136

2022

Volltextzugriff (PDF)

An ant colony optimization metaheuristic for single-path multicommodity network flow problems

Journal of the Operational Research Society, 2010-09, Vol.61 (9), p.1340-1355

2010

Volltextzugriff (PDF)

Fixed charge multicommodity network design using p-partition facets

European journal of operational research, 2017-04, Vol.258 (1), p.124-135

2017

Volltextzugriff (PDF)

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks

European journal of operational research, 2010-08, Vol.204 (3), p.604-612

2010

Volltextzugriff (PDF)

A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem

Computers & operations research, 2020-03, Vol.115, p.104847, Article 104847

2020

Volltextzugriff (PDF)

A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem

Omega (Oxford), 2012-04, Vol.40 (2), p.210-217

2012

Volltextzugriff (PDF)

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Computers & operations research, 2011, Vol.38 (1), p.152-164

2011

Volltextzugriff (PDF)

Models and column generation approach for the resource-constrained minimum cost path problem with relays

Omega (Oxford), 2017-01, Vol.66, p.79-90

2017

Volltextzugriff (PDF)

Using branch-and-price approach to solve the directed network design problem with relays

Omega (Oxford), 2012-10, Vol.40 (5), p.672-679

2012

Volltextzugriff (PDF)

A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks

INFORMS journal on computing, 2012-06, Vol.24 (3), p.443-456

2012

Volltextzugriff (PDF)

Scheduling of parts and robot activities in a two machine robotic cell

Computers & operations research, 1999-04, Vol.26 (4), p.297-312

1999

Volltextzugriff (PDF)

Returns operations in omnichannel retailing with buy-online-and-return-to-store

Omega (Oxford), 2023-09, Vol.119, p.102874, Article 102874

2023

Volltextzugriff (PDF)

Ride-matching for the ride-hailing platform with heterogeneous drivers

Transport policy, 2023-06, Vol.136, p.169-192

2023

Volltextzugriff (PDF)

An exact approach for the service network design problem with heterogeneous resource constraints

Omega (Oxford), 2021-07, Vol.102, p.102376, Article 102376

2021

Volltextzugriff (PDF)

Integrated design of cellular manufacturing systems in the presence of alternative process plans

International journal of production research, 1990-08, Vol.28 (8), p.1541-1554

1990

Volltextzugriff (PDF)

Minimal-cost system reliability with discrete-choice sets for components

IEEE transactions on reliability, 2004-03, Vol.53 (1), p.71-76

2004

Volltextzugriff (PDF)

1 – 25 von 117

Menü

Weitere Dienste

Einstellungen

A new branch-and-cut approach for the generalized regenerator location problem

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms

An ant colony optimization metaheuristic for machine–part cell formation problems

Matheuristics for the single-path design-balanced service network design problem

An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem

Supply regulation under the exclusion policy in a ride-sourcing market

Integrating order delivery and return operations for order fulfillment in an online retail environment

Integrated order allocation and order routing problem for e-order fulfillment

Single-path service network design problem with resource constraints

Directed fixed charge multicommodity network design: A cutting plane approach using polar duality

An ant colony optimization metaheuristic for single-path multicommodity network flow problems

Fixed charge multicommodity network design using p-partition facets

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks

A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem

A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Models and column generation approach for the resource-constrained minimum cost path problem with relays

Using branch-and-price approach to solve the directed network design problem with relays

A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks

Scheduling of parts and robot activities in a two machine robotic cell

Returns operations in omnichannel retailing with buy-online-and-return-to-store

Ride-matching for the ride-hailing platform with heterogeneous drivers

An exact approach for the service network design problem with heterogeneous resource constraints

Integrated design of cellular manufacturing systems in the presence of alternative process plans

Minimal-cost system reliability with discrete-choice sets for components

Suchergebnisse filtern