scientific article; zbMATH DE number 795214
From MaRDI portal
Publication:4845363
zbMath0833.90116MaRDI QIDQ4845363
No author found.
Publication date: 11 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmanproduction planningshortest pathsnetwork designassignmentnetwork optimizationminimum spanning treesmaximum flowsminimum cost flows
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (22)
Impact of the topology of urban streets on mobility optimization ⋮ Minimum spanning trees in networks with varying edge weights ⋮ Assessing the efficiency of rapid transit configurations ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Risk‐averse optimization and resilient network flows ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project ⋮ Optimization methods for the planning of rapid transit systems ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ An exterior simplex type algorithm for the minimum cost network flow problem ⋮ A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs ⋮ Surrogate-Based Reduced-Dimension Global Optimization in Process Systems Engineering ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem
This page was built for publication:
