Series parallel composition of greedy linear programming problems

Series parallel composition of greedy linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor19951871
Country: Netherlands
Volume: 62
Issue: 1
Start Page Number: 1
End Page Number: 14
Publication Date: Oct 1993
Journal: Mathematical Programming
Authors: , ,
Keywords: programming: transportation, transportation: general
Abstract:

The authors study the concept of series and parallel composition of linear programming problems and show that greedy properties are inherited by such compositions. The present results are inspired by earlier work on compositions of flow problems. The authors make use of certain Monge properties as well as convexity properties which support the greedy method in other contexts.

Reviews

Required fields are marked *. Your email address will not be published.