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 two-resource allocation algorithm with an application to large-scale zero-sum defensive games

Computers & operations research, 2017-02, Vol.78, p.218-229

2017

Volltextzugriff (PDF)

Allocating multiple defensive resources in a zero-sum game setting

Annals of operations research, 2015-02, Vol.225 (1), p.91-109

2015

Volltextzugriff (PDF)

Truncation Strategies in Matching Markets-in Search of Advice for Participants

Econometrica, 1999-01, Vol.67 (1), p.21-43

1999

Volltextzugriff (PDF)

Nonnegative ranks, decompositions, and factorizations of nonnegative matrices

Linear algebra and its applications, 1993-09, Vol.190, p.149-168

1993

Volltextzugriff (PDF)

Characterization of stable matchings as extreme points of a polytope

Mathematical programming, 1992-02, Vol.54 (1), p.57-67

ROTHBLUM, U. G

1992

Volltextzugriff (PDF)

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment

Operations research, 1985-07, Vol.33 (4), p.820-834

1985

Volltextzugriff (PDF)

Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields

Mathematical programming, 1992-01, Vol.53 (3), p.307-321

1992

Volltextzugriff (PDF)

Stable Matchings, Optimal Assignments, and Linear Programming

Mathematics of operations research, 1993-11, Vol.18 (4), p.803-828

1993

Volltextzugriff (PDF)

Sortability of vector partitions

Discrete mathematics, 2003-02, Vol.263 (1), p.129-142

2003

Volltextzugriff (PDF)

Generalization of an engineering principle

Operations research letters, 1992-10, Vol.12 (4), p.197-199

1992

Volltextzugriff (PDF)

Convex integer maximization via Graver bases

Journal of pure and applied algebra, 2009-08, Vol.213 (8), p.1569-1577

2009

Volltextzugriff (PDF)

A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion

International journal of game theory, 2008, Vol.36 (3), p.519-535

2008

Volltextzugriff (PDF)

Computing optimal scalings by parametric network algorithms

Mathematical programming, 1985-05, Vol.32 (1), p.1-10

1985

Volltextzugriff (PDF)

A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

Operations research, 1982-09, Vol.30 (5), p.1018-1022

1982

Volltextzugriff (PDF)

Paths to marriage stability

Discrete Applied Mathematics, 1995-10, Vol.63 (1), p.1-12

1995

Volltextzugriff (PDF)

Partition polytopes over 1-dimensional points

Mathematical programming, 1999-06, Vol.85 (2), p.335-362

1999

Volltextzugriff (PDF)

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions

Mathematics of operations research, 1996-08, Vol.21 (3), p.540-554

1996

Volltextzugriff (PDF)

Evaluation, strength, and relevance of variables of boolean functions

SIAM journal on discrete mathematics, 2000, Vol.13 (3), p.302-312

2000

Volltextzugriff (PDF)

Multiperiod allocation of substitutable resources

European journal of operational research, 1995-09, Vol.85 (3), p.488-503

1995

Volltextzugriff (PDF)

Maximum likelihood estimation of cell probabilities in constrained multinomial models

Journal of statistical computation and simulation, 1998-09, Vol.61 (1-2), p.141-161

1998

Volltextzugriff (PDF)

Convex Combinatorial Optimization

Discrete & computational geometry, 2004-11, Vol.32 (4), p.549-566

2004

Volltextzugriff (PDF)

Optimal partitions having disjoint convex and conic hulls

Mathematical programming, 1992-02, Vol.54 (1), p.69-86

1992

Volltextzugriff (PDF)

Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs

Operations research, 1993-09, Vol.41 (5), p.959-971

1993

Volltextzugriff (PDF)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications

Mathematical programming, 1994-03, Vol.64 (3), p.337-363

1994

Volltextzugriff (PDF)

Inducing coordination in supply chains through linear reward schemes

Naval research logistics, 2006-02, Vol.53 (1), p.1-15

2006

Volltextzugriff (PDF)

1 – 25 von 110

Menü

Weitere Dienste

Einstellungen

A two-resource allocation algorithm with an application to large-scale zero-sum defensive games

Allocating multiple defensive resources in a zero-sum game setting

Truncation Strategies in Matching Markets-in Search of Advice for Participants

Nonnegative ranks, decompositions, and factorizations of nonnegative matrices

Characterization of stable matchings as extreme points of a polytope

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment

Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields

Stable Matchings, Optimal Assignments, and Linear Programming

Sortability of vector partitions

Generalization of an engineering principle

Convex integer maximization via Graver bases

A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion

Computing optimal scalings by parametric network algorithms

A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

Paths to marriage stability

Partition polytopes over 1-dimensional points

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions

Evaluation, strength, and relevance of variables of boolean functions

Multiperiod allocation of substitutable resources

Maximum likelihood estimation of cell probabilities in constrained multinomial models

Convex Combinatorial Optimization

Optimal partitions having disjoint convex and conic hulls

Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs

Relaxation-based algorithms for minimax optimization problems with resource allocation applications

Inducing coordination in supply chains through linear reward schemes

Suchergebnisse filtern