- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
Combinatorial Optimization comprises research-level linear and combinatorial problems together with algorithms and solution-procedures to solve them. The growing need of the industry and the increase in complexity of conglomerates and multinationals entail focus on two very significant classes of problems; namely Transportation and Assignment Problems included in this volume. Far-reaching variants of these problems like the Multi-index and Multi-objective Problems, Bulk Transportation Problems, Flow and Budgetary Constrained Transportation Problems and the Three-Axial Sums Problems are investigated and analysed. Extensions to the Two-Stage and Bi-level Allocation Problems form the salient features of the book. Practical applications of the problems examined are also discussed. This volume opens new avenues for research in the field of allocation problems.
Contents
Opine
Foreword
Preface
SECTION-1: Variants of the Standard Transportation Problem - Time Minimizing Solid Transportation Problem
Pricing of Bottlenecks at Optimal Time in a Transportation Problem
On Bi-criteria Transportation Problem
SECTION-2: Flow Constrained Transportation Problems - Flow Constrained Transportation Problem with Mixed Type of Supply Point and Determination Constraints
Maximizing Transportation Flow under Budgetary Constraint
Constrained Transportation Problem with Upper and Lower Bounds on Row-availabilities and Destination Requirements
SECTION-3: Lexicographic Approach to Solve Transportation Problems - On Lexicographic Optimal Solutions in Transportation Problems
On a Standard Time Transportation Problem
Section-4: Two Stage Time Minimizing Transportation Problems - A Polynomial Algorithm for a Two-stage Time Minimizing Transportation Problem
Two Stage Interval Time Minimizing Transportation Problem
Section-5: Transportation Problems with Axial Constraints - The 'Three Axial Sums' Problem with Capacity Restrictions
Cost-time Trade-off in 'Three-axial Sums' Transportation Problem
Section-6: Bulk Transportation Problems - A Branch and Bound Procedure for Cost Minimizing Bulk Transportation Problem
Time-cost Trade-off Relations in Bulk Transportation Problem
Section-7: Variants of the Standard Assignment Problem - Variants of the Assignment Problem
The Three Dimensional Bottleneck Assignment Problem and its Variants
The Bicriteria Assignment Problem
Section-8: Lexi-search Approach to Solve Assignment Problems - Minimization of Makespan in Generalized Assignment Problem
A Lexi-search Algorithm for a Time Minimizing Assignment Problem
Section-9: Two-stage Time Minimizing Assignment Problems - Two-stage Time Minimizing Assignment Problem
Bilevel Time Minimizing Assignment Problem
References.
