The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
DOI10.1016/0377-2217(86)90302-4zbMATH Open0582.90074OpenAlexW2074639186MaRDI QIDQ1068720FDOQ1068720
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
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
planningbranch and bound algorithminteger, multicommodity network flow modelmultiperiod assignment problemshortest path heuristic algorithm
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)
Cites Work
- A note on two problems in connexion with graphs
- Facets of the three-index assignment polytope
- On a routing problem
- 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
- Title not available (Why is that?)
- Letter to the Editor—The Multidimensional Assignment Problem
- Title not available (Why is that?)
- New Methods in Mathematical Programming—The Solid Transportation Problem
- A Survey of Linear Cost Multicommodity Network Flows
- Branch-and-Bound Methods: A Survey
- Complexity of a 3-dimensional assignment problem
- Feasibility of Two Commodity Network Flows
- Multi-Commodity Network Flows
- Title not available (Why is that?)
- Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
- Title not available (Why is that?)
- Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
- Generalized upper bounding techniques
- Title not available (Why is that?)
- On Two Commodity Network Flows
- The Multi-Index Problem
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- Traffic assignment in communication satellites
- Title not available (Why is that?)
- Graphic matroids and the multicommodity transportation problem
- Two commodity network flows and linear programming
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Shortest Path and Network Flow Algorithms
- The multicommodity assignment problem: A network aggregation heuristic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Network topology and integral multicommodity flow problems
- The simplex method for integral multicommodity networks
Cited In (12)
- A multi-period machine assignment problem
- The Multicommodity Multilevel Bottleneck Assignment Problem
- Guided design search in the interval-bounded sailor assignment problem
- The task assignment problem for unrestricted movement between workstation groups
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Branch-and-cut for a 2-commodity flow relocation model with time constraints
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Title not available (Why is that?)
- A heuristic solution procedure for multicommodity integer flows
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern
- A survey of dynamic network flows
- Effective material flow at an assembly facility
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)
