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

DOI10.1016/0377-2217(86)90302-4MaRDI QIDQ1068720zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximation and Online Algorithms
• Solving Multicommodity Flow Problems by an Approximation Scheme
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• The Multicommodity Multilevel Bottleneck Assignment Problem
• Multicommodity network flows: A survey. II: Solution methods
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• A combined matheuristic for the piecewise linear multicommodity network flow problem
• A forward network simplex algorithm for solving multiperiod network flow problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs

Cites work

• scientific article; zbMATH DE number 3146438 (Why is no real title available?)
• scientific article; zbMATH DE number 3167495 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3614523 (Why is no real title available?)
• scientific article; zbMATH DE number 3210523 (Why is no real title available?)
• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• scientific article; zbMATH DE number 3240945 (Why is no real title available?)
• scientific article; zbMATH DE number 3255363 (Why is no real title available?)
• scientific article; zbMATH DE number 3371840 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• A Survey of Linear Cost Multicommodity Network Flows
• 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
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A note on two problems in connexion with graphs
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Branch-and-Bound Methods: A Survey
• Complexity of a 3-dimensional assignment problem
• Facets of the three-index assignment polytope
• Feasibility of Two Commodity Network Flows
• Generalized upper bounding techniques
• Graphic matroids and the multicommodity transportation problem
• Letter to the Editor—The Multidimensional Assignment Problem
• Multi-Commodity Network Flows
• Network topology and integral multicommodity flow problems
• New Methods in Mathematical Programming—The Solid Transportation Problem
• Note—On the Use of Fictitious Bounds in Tree Search Algorithms
• On Two Commodity Network Flows
• On a routing problem
• Shortest Path and Network Flow Algorithms
• Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
• Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
• The Multi-Index Problem
• The multicommodity assignment problem: A network aggregation heuristic
• The simplex method for integral multicommodity networks
• Traffic assignment in communication satellites
• Two commodity network flows and linear programming

Cited in

(12)

• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Guided design search in the interval-bounded sailor assignment problem
• Branch-and-cut for a 2-commodity flow relocation model with time constraints
• A survey of dynamic network flows
• A multi-period machine assignment problem
• Effective material flow at an assembly facility
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• scientific article; zbMATH DE number 221925 (Why is no real title available?)
• A heuristic solution procedure for multicommodity integer flows
• The Multicommodity Multilevel Bottleneck Assignment Problem
• A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern
• The task assignment problem for unrestricted movement between workstation groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068720)