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...

The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights

INFOR. Information systems and operational research, 2006-12, Vol.44 (4), p.267-283

2006

Volltextzugriff (PDF)

The 1-minimax and 1-maximin problems with demand weights of general probability distributions

Networks, 2007-09, Vol.50 (2), p.127-135

2007

Volltextzugriff (PDF)

A 6 5 -approximation algorithm for the two-machine routing open-shop problem on a two-node network

European journal of operational research, 2005-10, Vol.166 (1), p.3-24

2005

Volltextzugriff (PDF)

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network : Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications

European journal of operational research, 2005, Vol.166 (1), p.3-24

2005

Volltextzugriff (PDF)

Adoption of Electric Vehicles in Car Sharing Market

Production and operations management, 2021-01, Vol.30 (1), p.190-209

2021

Volltextzugriff (PDF)

Algorithms for path medi-centers of a tree

Computers & operations research, 1999-12, Vol.26 (14), p.1395-1409

1999

Volltextzugriff (PDF)

Algorithms for the robust 1-center problem on a tree

European journal of operational research, 2000-06, Vol.123 (2), p.292-302

2000

Volltextzugriff (PDF)

Almost Robust Discrete Optimization

European journal of operational research, 2019-07, Vol.276 (2), p.451-465

2019

Volltextzugriff (PDF)

Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers

IIE transactions, 1981-03, Vol.13 (1), p.2

1981

Volltextzugriff (PDF)

Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers

AIIE transactions, 1981-03, Vol.13 (1), p.2-11

1981

Volltextzugriff (PDF)

Approximating Performance Measures for a Network of Unreliable Machines

IIE transactions, 2003-07, Vol.35 (7), p.665-677

2003

Volltextzugriff (PDF)

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

European journal of operational research, 2005-10, Vol.166 (1), p.3-24

2005

Volltextzugriff (PDF)

Area Editor's Statement

Operations research, 1998-01, Vol.46 (1), p.iii-iii

Berman, Oded

1998

Volltextzugriff (PDF)

Balancing staffing and switching costs in a service center with flexible servers

European journal of operational research, 2007-03, Vol.177 (2), p.924-938

2007

Volltextzugriff (PDF)

Bargaining in competing supply chains with uncertainty

European journal of operational research, 2009-09, Vol.197 (2), p.548-556

2009

Volltextzugriff (PDF)

Bargaining within the Supply Chain and Its Implications in an Industry

Decision sciences, 2016-04, Vol.47 (2), p.193-218

2016

Volltextzugriff (PDF)

Big segment small segment global optimization algorithm on networks

Networks, 2011-08, Vol.58 (1), p.1-11

2011

Volltextzugriff (PDF)

A bilevel model for preventive healthcare facility network design with congestion

IIE transactions, 2010-12, Vol.42 (12), p.865-880

2010

Volltextzugriff (PDF)

Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints

INFORMS journal on computing, 1996-11, Vol.8 (4), p.361-366

1996

Volltextzugriff (PDF)

Can flexibility be constraining?

IIE transactions, 2010-01, Vol.42 (1), p.45-59

2010

Volltextzugriff (PDF)

The capacity expansion problem in the service industry

Computers & operations research, 1994-05, Vol.21 (5), p.557-572

1994

Volltextzugriff (PDF)

The capacity expansion problem in the service industry with multiple resource constraints

Socio-economic planning sciences, 1992, Vol.26 (1), p.1-14

1992

Volltextzugriff (PDF)

Categorized bottleneck-minisum path problems on networks

Operations research letters, 1994-12, Vol.16 (5), p.291-297

1994

Volltextzugriff (PDF)

Choosing an optimal set of libraries [software reliability]

IEEE transactions on reliability, 1996-06, Vol.45 (2), p.303-307

1996

Volltextzugriff (PDF)

The collection depots location problem on networks

Naval research logistics, 2002-02, Vol.49 (1), p.15-24

2002

Volltextzugriff (PDF)

1 – 25 von 272

Menü

Weitere Dienste

Einstellungen

The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights

The 1-minimax and 1-maximin problems with demand weights of general probability distributions

A 6 5 -approximation algorithm for the two-machine routing open-shop problem on a two-node network

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network : Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications

Adoption of Electric Vehicles in Car Sharing Market

Algorithms for path medi-centers of a tree

Algorithms for the robust 1-center problem on a tree

Almost Robust Discrete Optimization

Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers

Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers

Approximating Performance Measures for a Network of Unreliable Machines

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

Area Editor's Statement

Balancing staffing and switching costs in a service center with flexible servers

Bargaining in competing supply chains with uncertainty

Bargaining within the Supply Chain and Its Implications in an Industry

Big segment small segment global optimization algorithm on networks

A bilevel model for preventive healthcare facility network design with congestion

Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints

Can flexibility be constraining?

The capacity expansion problem in the service industry

The capacity expansion problem in the service industry with multiple resource constraints

Categorized bottleneck-minisum path problems on networks

Choosing an optimal set of libraries [software reliability]

The collection depots location problem on networks

Suchergebnisse filtern