scientific article; zbMATH DE number 7453715
From MaRDI portal
Publication:5020877
zbMath1480.90086MaRDI QIDQ5020877
Publication date: 7 January 2022
Full work available at URL: http://www.orstw.org.tw/ijor/vol15no4/IJOR2018_vol15_no4_p145_p153.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (4)
Dynamic multicommodity contraflow problem with asymmetric transit times ⋮ Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints ⋮ Unnamed Item ⋮ Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of dynamic network flows
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Facility location models for distribution planning
- Combinatorial approaches to multiflow problems
- Partitioning procedures for solving mixed-variables programming problems
- Multicommodity flows in planar graphs
- Matroids and multicommodity flows
- Integer programming in VLSI design
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
- Multicommodity flow models for spanning trees with hop constraints
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- Geometric algorithms and combinatorial optimization.
- Multicommodity network flow with jump constraints
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Potential function methods for approximately solving linear programming problems: theory and practice.
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- Service network design in freight transportation
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- A branch-and-bound method for multicommodity location with balancing requirements
- Computational experience with a difficult mixed-integer multicommodity flow problem
- Multicommodity flows in graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- ATM network design: Traffic models and optimization-based heuristics
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- A heuristic solution procedure for multicommodity integer flows
- The fleet assignment problem: Solving a large scale integer program
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Primal partition programming for block diagonal matrices
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- The Decomposition Algorithm for Linear Programs
- A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
- Multicommodity Distribution System Design by Benders Decomposition
- On the Computational Complexity of Combinatorial Problems
- A minimum-cost multicommodity network flow problem concerning imports and exports
- On the Complexity of Timetable and Multicommodity Flow Problems
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
- Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
- A survey on multi-net global routing for integrated circuits
- Computing Wardropian equilibria in a complementarity framework
- Minimizing stall time in single and parallel disk systems
- On Two Commodity Network Flows
- A generalized upper bounding algorithm for multicommodity network flow problems
- Two commodity network flows and linear programming
- Integer Programming and Combinatorial Optimization
- Multi-Commodity Network Flows
- Strong inequalities for capacitated survivable network design problems.
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
This page was built for publication:
