Technical Note—Solving Constrained Multi-Facility Location Problems InvolvinglpDistances Using Convex Programming

Operations Research - United States
doi 10.1287/opre.23.3.581
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems With Generalized Mixed Equilibrium Problems

Journal of Function Spaces and Applications
2012English

Technical Note—Determining All Optimal and Near-Optimal Solutions When Solving Shortest Path Problems by Dynamic Programming

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1984English

Solving Bipolar Max-Tp Equation Constrained Multi-Objective Optimization Problems

International Journal on Soft Computing
2016English

Distance Constrained Location Problems

Industrial Engineering & Management
2015English

On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method

International Journal of Mathematics and Mathematical Sciences
Mathematics
2018English

Multi-Floor Facility Layout Problems Solving by the Differential Evolution Method

Journal of Engineering and Applied Sciences
Engineering
2019English

Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2018English

Modality Constrained Programming Problems and Various Fuzzy Mathematical Programming Problems

Transactions of the Institute of Systems, Control and Information Engineers
1990English

Solving Stochastic Programming Problems Using Modified Differential Evolution Algorithms

Logic Journal of the IGPL
Philosophy
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy