scientific article; zbMATH DE number 3564698

zbMATH Open0362.90076MaRDI QIDQ4136942FDOQ4136942

Authors: Eugene L. Lawler 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cited In (14)

• Probabilistic single processor scheduling
• The point-to-point delivery and connection problems: Complexity and algorithms
• Using euler partitions to edge color bipartite multigraphs
• A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• A variant of time minimizing assignment problem
• Minimum \(k\) arborescences with bandwidth constraints
• Odd path packings
• A particular timetable problem: Terminal scheduling
• On the use of augmenting chains in chain packings
• Packings by cliques and by finite families of graphs
• Paroids: A canonical format for combinatorial optimization
• Reducing horizontal linear complementarity problems
• Balanced optimization problems

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 Q4136942)