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