A Partitioning Problem with Applications in Regional Design
From MaRDI portal
Cited in
(22)- A generalized bottleneck assignment problem
- Partially finite convex programming. II: Explicit lattice models
- On the optimality of differentiable nonconvex n-set functions
- Algorithms for large scale set covering problems
- On optimality and duality for multiobjective programming problems involving generalized d-type-I and related n-set functions.
- Generalized V-univexity type-I for multiobjective programming with n-set functions
- Duality for generalized fractional programs involving n-set functions
- Sufficiency in multiobjective subset programming involving generalized type-I functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- An algorithm of solution of a multiproduct problem of optimal partitioning with constraints
- Nearest-neighbour rules for emergency services
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Oil minmax programming problems containing n-set functions
- Second order duality for mathematical programming involving n-set functions
- Semi-infinite transportation problems
- On a general duality model in multiobjective fractional programming with \(n\)-set functions
- New concepts of generalized convexity in multiobjective subset programming
- Fuzzy two-stage continuous-discrete optimal set partitioning problem. I: Theoretical foundations
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Efficiency in integral facility design problems
- The saddle theorem for multiobjective generalized fractional programming problems with set functions
This page was built for publication: A Partitioning Problem with Applications in Regional Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663619)
