scientific article; zbMATH DE number 3333906

MaRDI QIDQ5611549zbMATH OpenFDO

Authors Dominique De Werra

Publication date 1970

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Cited in

(12)

• A result on generalized Latin rectangles
• A language and a program for stating and solving combinatorial problems
• Short solution of Kotzig's problem for bipartite graphs
• Partially concurrent open shop scheduling with integral preemptions
• A generalized class-teacher model for some timetabling problems
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• A survey on the existence ofG-Designs
• Edge Coloring and Decompositions of Weighted Graphs
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
• Enumeration algorithm for the edge coloring problem on bipartite graphs
• Decomposition of complete graphs into forests with six edges
• Time slot scheduling of compatible jobs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5611549)