Search

Your search keyword '"Multi-commodity flow problem"' showing total 280 results

Search Constraints

Start Over You searched for: Descriptor "Multi-commodity flow problem" Remove constraint Descriptor: "Multi-commodity flow problem" Topic management science and operations research Remove constraint Topic: management science and operations research
280 results on '"Multi-commodity flow problem"'

Search Results

1. A network flow-based algorithm for bus driver rerostering

2. Liner shipping network design

3. A new multicommodity flow model for the job sequencing and tool switching problem

4. State-of-the-Art Auction Algorithms for Multi-depot Bus Scheduling Problem Considering Depot Workload Balancing Constraints

5. A simulation-optimization approach for the stochastic discrete cost multicommodity flow problem

6. The p-arborescence star problem: Formulations and exact solution approaches

7. Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches

8. On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths

9. Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem

10. Multi-depot periodic vehicle routing problem with due dates and time windows

11. Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem

12. Models for the piecewise linear unsplittable multicommodity flow problems

13. A network simplex method for the budget-constrained minimum cost flow problem

14. Fixed charge multicommodity network design using p -partition facets

15. A polynomial time algorithm for the minimum flow problem in time-varying networks

16. Metaheuristics for solving the biobjective single-path multicommodity communication flow problem

17. A column generation approach to high school timetabling modeled as a multicommodity flow problem

18. A branch-and-price approach for solving the train unit scheduling problem

19. Train unit scheduling guided by historic capacity provisions and passenger count surveys

20. Robust flows with losses and improvability in evacuation planning

21. Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

22. Near optimal design of wavelength routed optical networks

23. Analysis of budget for interdiction on multicommodity network flows

24. Pooling Problems with Polynomial-Time Algorithms

25. Resilient overlay design in DWDM systems

26. Integral flow decomposition with minimum longest path length

27. Multicommodity Production Planning: Qualitative Analysis and Applications

28. The computational complexity of the pooling problem

29. Analysis of a dynamic lot-sizing problem with production capacity constraint

30. A Network Design Problem with Two-Edge Matching Failures

31. Performance of a routing and wavelength assignment scheme for an optical‐carrier‐reusable ring network

32. Multi-objective meta-heuristics to solve three-stage assembly flow shop scheduling problem with machine availability constraints

33. On finding representative non-dominated points for bi-objective integer network flow problems

34. System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network

35. Characteristics of optimal solutions to the sensor location problem

36. Symbiotic network design strategies in the presence of coexisting transportation networks

37. Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks

38. A maximum flow formulation of a multi-period open-pit mining problem

39. An algorithm for solving a capacitated indefinite quadratic transportation problem with enhanced flow

40. Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

41. A two-phase approach for real-world train unit scheduling

42. Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations

43. Global optimization of capacity expansion and flow assignment in multicommodity networks

44. Design of Survivable Networks Using Three- and Four-Partition Facets

45. Decomposition's Dantzig–Wolfe applied to fuzzy multicommodity flow problems

46. Iterative mass balance method for the multi-commodity flow maximisation problem

47. A faster polynomial algorithm for the constrained maximum flow problem

48. The problem of maximum flow with minimum attainable cost in a network

49. A constraint programming-based approach to a large-scale energy management problem with varied constraints

50. A multi-commodity flow formulation for the generalized pooling problem

Catalog

Books, media, physical & digital resources