Variants of shortest path problems

P. 89-94

• Chapters from the same volume (available individually)

  • Preface
    Get chapter
  • Optimization on networks : facility location problems
    Get chapter
  • An overview of discrete location
    Get chapter
  • Routing problems
    Get chapter
  • From local to global in numerical optimization
    Get chapter
  • On some applications of combinatorial optimization
    Get chapter
  • Bilevel programming and price optimization problems in transportation and production planning
    Get chapter
  • Location problems in supply chain management
    Get chapter
  • Game theory
    Get chapter
  • Optimizing dc functions : methods and applications
    Get chapter
  • Vehicle routing for mixed solid waste collection comparing alternative hierarchical formulations
    Get chapter
  • On the complexity and heuristic methods for a new arc routing problem
    Get chapter
  • Cut-first branch-and-price-second for the capacitated arc-routing problem
    Get chapter
  • An adaptive large neighborhood search for the pickup and delivery problem with transfers
    Get chapter
  • Mail-delivery problems with park-and-loop tours : a heuristic approach
    Get chapter
  • Affine recourse for the robust network design problem : between static and dynamic routing
    Get chapter
  • Variants of shortest path problems
  • Fixed or variable demand? : does it matter when locating a facility?
    Get chapter
  • Allocation and location space based branch and bound algorithms for the capacitated multi-facility Weber problem
    Get chapter
  • Single-facility Huff location problems on networks : a DC approachs
    Get chapter
  • On generating robust solutions of quadratically constrained bi-blending recipe designs
    Get chapter
  • An improved semidefinite programming relaxation for max k-equipartitions
    Get chapter
  • Multicriteria allocation problem
    Get chapter
  • The three-dimensional knapsack problem with balancing constraints
    Get chapter
  • Characterization of facets of the hop constrained chain polytope via Dynamic Programming
    Get chapter
  • Nesting problems : mixed integer formulations and valid inequalities
    Get chapter
  • Robust partitioning for stochastic multi-vehicle routing
    Get chapter
  • Solving multi-objective traffic assignment
    Get chapter
  • Heuristics for a stochastic and dynamic routing problem in industrial shipping
    Get chapter
  • Robust UAV mission planning
    Get chapter
  • Convexity and the Shapley value in Bertrand oligopoly TU-games
    Get chapter
  • A stochastic R&D competition where winner takes all.
    Get chapter
  • Ranking asymmetric auctions
    Get chapter
  • A lagrangean heuristic for a nonlinear minsum facility location problem
    Get chapter
  • Semi-lagrangean approach for price discovery in markets with non-convexities
    Get chapter
  • When is rounding allowed? : a new approach to integer nonlinear optimization
    Get chapter
  • Conjugate duality of set-valued functions
    Get chapter
  • A heuristic for the circle packing problem with a variety of containers
    Get chapter
  • Approximate solving of large p-median problems
    Get chapter
  • Integrating synchronization bus timetabling and single-depot single-type vehicle scheduling
    Get chapter
  • Locating optimal timetables and vehicle schedules in a transit line
    Get chapter
  • Solution algorithms for uncertain R||ƩCᵢ problem with interval processing times
    Get chapter
  • Multistage stochastic programming in strategic telecommunication network plannings
    Get chapter
  • Column generation in the Integral Simplex Method
    Get chapter
  • A network pricing formulation for the revenue maximization of European Air Navigation service providers
    Get chapter
  • A mixed 0–1 nonlinear approach for the collision avoidance in ATM : velocity changes through a time horizon
    Get chapter
  • Index of authors
    Get chapter

  Show more
• Information

  ISBN: 9788498287431

  Permalink: https://digital.casalini.it/4657509