scientific article; zbMATH DE number 758733
From MaRDI portal
Publication:4834366
zbMath0816.00040MaRDI QIDQ4834366
No author found.
Publication date: 28 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (23)
Routing of uncertain traffic demands ⋮ Fuzzy trees in decision support systems ⋮ A note on the nestedness property for ordered median problems in tree networks ⋮ On Groves mechanisms for costly inclusion ⋮ Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks ⋮ Network simplex algorithm for the general equal flow problem. ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ A survivable variant of the ring star problem ⋮ A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ Scenario tree construction driven by heuristic solutions of the optimization problem ⋮ Online constrained forest and prize-collecting network design ⋮ Determination of the candidate arc set for the asymmetric traveling salesman problem ⋮ Improved algorithms for the Steiner problem in networks ⋮ Improved bounds on the probability of the union of events some of whose intersections are empty ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Airport management: taxi planning ⋮ Paths and Trails in Edge-Colored Graphs ⋮ ENHANCING INTERNET NETWORK RELIABILITY WITH INTEGRATED FRAMEWORK OF MULTI-OBJECTIVE GENETIC ALGORITHM AND MONTE CARLO SIMULATION ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ Best- and worst-case variances when bounds are available for the distribution function. ⋮ Scheduling multi-colour print jobs with sequence-dependent setup times ⋮ The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. ⋮ On the exponential cardinality of FDS for the ordered \(p\)-median problem
This page was built for publication:
