The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm

DOI10.1016/0377-2217(86)90302-4zbMath0582.90074OpenAlexW2074639186MaRDI QIDQ1068720

Jay E. Aronson

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90302-4

zbMATH Keywords

planningbranch and bound algorithminteger, multicommodity network flow modelmultiperiod assignment problemshortest path heuristic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (7)

Effective material flow at an assembly facility ⋮ A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern ⋮ A heuristic solution procedure for multicommodity integer flows ⋮ A binary-rounding heuristic for multi-period variable-task-duration assignment problems ⋮ The task assignment problem for unrestricted movement between workstation groups ⋮ A survey of dynamic network flows ⋮ A multi-period machine assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Traffic assignment in communication satellites
• The multicommodity assignment problem: A network aggregation heuristic
• Complexity of a 3-dimensional assignment problem
• Facets of the three-index assignment polytope
• Generalized upper bounding techniques
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• On a routing problem
• New Methods in Mathematical Programming—The Solid Transportation Problem
• Shortest Path and Network Flow Algorithms
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• A bilinear programming formulation of the 3-dimensional assignment problem
• A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem
• Note—On the Use of Fictitious Bounds in Tree Search Algorithms
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Graphic matroids and the multicommodity transportation problem
• A Survey of Linear Cost Multicommodity Network Flows
• Network topology and integral multicommodity flow problems
• The simplex method for integral multicommodity networks
• Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
• On Two Commodity Network Flows
• Branch-and-Bound Methods: A Survey
• Letter to the Editor—The Multidimensional Assignment Problem
• Feasibility of Two Commodity Network Flows
• Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
• Two commodity network flows and linear programming
• The Multi-Index Problem
• Multi-Commodity Network Flows

This page was built for publication: The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm