Discrete and fractional programming techniques for location models
From MaRDI portal
Publication:1389389
zbMath0907.90258MaRDI QIDQ1389389
Publication date: 25 June 1998
Published in: Combinatorial Optimization (Search for Journal in Brave)
Fractional programming (90C32) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (15)
Global optimization of a rank-two nonconvex program ⋮ Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints ⋮ Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms ⋮ A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs ⋮ Conditional gradient method for double-convex fractional programming matrix problems ⋮ Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming ⋮ Level function method for quasiconvex programming. ⋮ On the supremum in linear fractional programming with respect to any closed unbounded feasible set ⋮ Facility location models for distribution system design ⋮ On generalized linearity of quadratic fractional functions ⋮ Underestimation functions for a rank-two partitioning method ⋮ What is quasiconvex analysis? ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ A sixth bibliography of fractional programming ⋮ Unnamed Item
This page was built for publication: Discrete and fractional programming techniques for location models
