scientific article; zbMATH DE number 758733

zbMATH Open0816.00040MaRDI QIDQ4834366FDOQ4834366

Author name not available (Why is that?)

Publication date: 28 May 1995

Title of this publication is not available (Why is that?)

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cited In (28)

A note on the nestedness property for ordered median problems in tree networks
Models for network evolution
A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem
An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
Fuzzy trees in decision support systems
A hybrid algorithm for solving network flow problems with side constraints.
Online constrained forest and prize-collecting network design
Title not available (Why is that?)
ENHANCING INTERNET NETWORK RELIABILITY WITH INTEGRATED FRAMEWORK OF MULTI-OBJECTIVE GENETIC ALGORITHM AND MONTE CARLO SIMULATION
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
A new integer programming formulation of the graphical traveling salesman problem
Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks
Routing of uncertain traffic demands
Determination of the candidate arc set for the asymmetric traveling salesman problem
Title not available (Why is that?)
Network simplex algorithm for the general equal flow problem.
Scheduling multi-colour print jobs with sequence-dependent setup times
Scenario tree construction driven by heuristic solutions of the optimization problem
Improved bounds on the probability of the union of events some of whose intersections are empty
On the exponential cardinality of FDS for the ordered \(p\)-median problem
Improved algorithms for the Steiner problem in networks
Best- and worst-case variances when bounds are available for the distribution function.
A survivable variant of the ring star problem
On Groves mechanisms for costly inclusion
A network application model with operational process feature
Airport management: taxi planning
Network models: action formulation
Paths and Trails in Edge-Colored Graphs

This page was built for publication:

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