H. Donald Ratliff

Available identifiers

zbMath Open ratliff.h-donaldMaRDI QIDQ803170

List of research outcomes

Publication	Date of Publication	Type
Minimal connected enclosures on an embedded planar graph	1999-03-30	Paper
Sequencing inputs to multi-commodity pipelines	1996-02-18	Paper
On The Complexity Of The Process Shop	1994-08-31	Paper
On an edge ranking problem of trees and graphs	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3356020	1991-01-01	Paper
Hierarchical solution of network flow problems	1990-01-01	Paper
Accumulation Point Location on Tree Networks for Guaranteed Time Distribution	1990-01-01	Paper
Optimal node ranking of trees	1988-01-01	Paper
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem	1983-01-01	Paper
Note—Some Equivalent Objectives for Dynamic Network Flow Problems	1982-01-01	Paper
A cut approach to a class of quadratic integer programming problems	1981-01-01	Paper
Cyclic Scheduling via Integer Programs with Circular Ones	1980-01-01	Paper
A Cut Approach to the Rectilinear Distance Facility Location Problem	1978-01-01	Paper
Distance Constraints for Tree Network Multifacility Location Problems	1978-01-01	Paper
Unnetworks, with Applications to Idle Time Scheduling	1978-01-01	Paper
Finding the n Most Vital Links in Flow Networks	1975-01-01	Paper
Minimum cuts and related problems	1975-01-01	Paper
A Network Approach to a Multi-Facility, Multi-Product Production Scheduling Problem Without Backordering	1975-01-01	Paper
Technical Note—A Production-Scheduling Problem with Batch Processing	1974-01-01	Paper
A Graph-Theoretic Equivalence for Integer Programs	1973-01-01	Paper
Minimal Cost Cut Equivalent Networks	1973-01-01	Paper
Determining the most vital link in a flow network	1972-01-01	Paper
Set Covering and Involutory Bases	1971-01-01	Paper
Set Covering and Involutory Bases	1971-01-01	Paper

Research outcomes over time

This page was built for person: H. Donald Ratliff