UB Paderborn / Katalog / Suche / in CDI

Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Mathematics of operations research, 1987-02, Vol.12 (1), p.50-59

1987

Volltextzugriff (PDF)

Vertex packings: Structural properties and algorithms

Mathematical programming, 1975-12, Vol.8 (1), p.232-248

1975

Volltextzugriff (PDF)

An Abstract Linear Duality Model

Mathematics of operations research, 1989-11, Vol.14 (4), p.639-663

1989

Volltextzugriff (PDF)

On Abstract Integral Dependence

Mathematics of operations research, 1989-11, Vol.14 (4), p.626-638

1989

Volltextzugriff (PDF)

Integer Rounding for Polymatroid and Branching Optimization Problems

SIAM journal on algebraic and discrete methods, 1981-12, Vol.2 (4), p.416-425

1981

Volltextzugriff (PDF)

Packing and covering with integral feasible flows in integral supply-demand networks

Mathematical programming, 1987-10, Vol.39 (3), p.231-239

1987

Volltextzugriff (PDF)

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem

Integer Programming and Combinatorial Optimization, 1999, Vol.1610, p.45-59

1999

Volltextzugriff (PDF)

Cardinality-restricted chains and antichains in partially ordered sets

Discrete Applied Mathematics, 1996-03, Vol.65 (1), p.421-439

1996

Volltextzugriff (PDF)

Finite checkability for integer rounding properties in combinatorial programming problems

Mathematical programming, 1982-12, Vol.22 (1), p.141-147

1982

Volltextzugriff (PDF)

When the Greedy Solution Solves a Class of Knapsack Problems

Operations research, 1975-03, Vol.23 (2), p.207-217

1975

Volltextzugriff (PDF)

On randomized stopping points and perfect graphs

Journal of combinatorial theory. Series B, 1988-12, Vol.45 (3), p.320-344

1988

Volltextzugriff (PDF)

A topological characterization for closed sets under polar duality in Q

Mathematical programming, 1990-12, Vol.49 (2), p.281-283

1990

Volltextzugriff (PDF)

Set Partitioning and Chain Decomposition

Management science, 1974-07, Vol.20 (11), p.1413-1423

1974

Volltextzugriff (PDF)

Stability critical graphs and ranks facets of the stable set polytope

Discrete mathematics, 1995-12, Vol.147 (1), p.247-255

1995

Volltextzugriff (PDF)

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs

Mathematical programming, 2003-03, Vol.95 (3), p.533-554

2003

Volltextzugriff (PDF)

Approaches to Integer Programming

1974

Volltextzugriff (PDF)

A class of facet producing graphs for vertex packing polyhedra

Discrete mathematics, 1975, Vol.12 (4), p.373-388

Trotter, L.E.

1975

Volltextzugriff (PDF)

Line perfect graphs

Mathematical programming, 1977-12, Vol.12 (1), p.255-259

Trotter, L. E.

1977

Volltextzugriff (PDF)

A generalization of Robacker's theorem

Discrete mathematics, 1989, Vol.74 (1), p.245-252

1989

Volltextzugriff (PDF)

Two easy duality theorems for product partial orders

Discrete Applied Mathematics, 1987, Vol.16 (3), p.283-286

1987

Volltextzugriff (PDF)

An Algorithm for the Bounded Variable Integer Programming Problem

Journal of the ACM, 1974-07, Vol.21 (3), p.505-513

1974

Volltextzugriff (PDF)

On stable set polyhedra for K1,3-free graphs

Journal of combinatorial theory. Series B, 1981-01, Vol.31 (3), p.313-326

1981

Volltextzugriff (PDF)

Graphical properties related to minimal imperfection

Discrete mathematics, 1979, Vol.27 (1), p.11-22

1979

Volltextzugriff (PDF)

Node-Packing Problems with Integer Rounding Properties

SIAM journal on discrete mathematics, 1989-08, Vol.2 (3), p.407-412

1989

Volltextzugriff (PDF)

Stability Critical Graphs and Even Subdivisions of K4

Journal of combinatorial theory. Series B, 1993-09, Vol.59 (1), p.74-84

1993

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Vertex packings: Structural properties and algorithms

An Abstract Linear Duality Model

On Abstract Integral Dependence

Integer Rounding for Polymatroid and Branching Optimization Problems

Packing and covering with integral feasible flows in integral supply-demand networks

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem

Cardinality-restricted chains and antichains in partially ordered sets

Finite checkability for integer rounding properties in combinatorial programming problems

When the Greedy Solution Solves a Class of Knapsack Problems

On randomized stopping points and perfect graphs

A topological characterization for closed sets under polar duality in Q

Set Partitioning and Chain Decomposition

Stability critical graphs and ranks facets of the stable set polytope

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs

Approaches to Integer Programming

A class of facet producing graphs for vertex packing polyhedra

Line perfect graphs

A generalization of Robacker's theorem

Two easy duality theorems for product partial orders

An Algorithm for the Bounded Variable Integer Programming Problem

On stable set polyhedra for K1,3-free graphs

Graphical properties related to minimal imperfection

Node-Packing Problems with Integer Rounding Properties

Stability Critical Graphs and Even Subdivisions of K4

Suchergebnisse filtern