Optimal Facility Location with Concave Costs
From MaRDI portal
Publication:4404695
DOI10.1287/opre.22.2.373zbMath0278.90079OpenAlexW2157924277MaRDI QIDQ4404695
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.2.373
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90)
Related Items
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, A finite concave minimization algorithm using branch and bound and neighbor generation, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A new Lagrangian-Benders approach for a concave cost supply chain network design problem, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Stochastic allocation of inspection capacity to competitive processes, The telephonic switching centre network problem: Formalization and computational experience, A revision of the rectangular algorithm for a class of DC optimization problems, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, A note on the solution of bilinear programming problems by reduction to concave minimization, An integrated plant loading model with economies of scale and scope, Service system design with immobile servers, stochastic demand and concave-cost capacity selection, A decomposition method for the min concave cost flow problem with a staircase structure, LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, An algorithm for the min concave cost flow problem, A general purpose exact solution method for mixed integer concave minimization problems, Modeling and solving an economies‐of‐scale service system design problem, Supply chain design considering economies of scale and transport frequencies, Algorithms for parametric nonconvex programming, Internet shopping with price sensitive discounts, Minimizing a sum of staircase functions under linear constraints, Locational analysis, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure, An improved branch and bound algorithm for minimum concave cost network flow problems, Stochastic facility location with general long-run costs and convex short-run costs, Global search algorithms for minimum concave-cost network flow problems, Strongly polynomial algorithm for a production-transportation problem with concave production cost, A computational study of a nonlinear minsum facility location problem, Reducing incremental costs associated with the delegation of incentive contracting decisions: An analysis of planning and control decisions in a manufacturing setting in the presence of moral hazard, Capacitated facility location problem with general setup cost, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, A fast exact method for the capacitated facility location problem with differentiable convex production costs, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Concave cost minimization on networks, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Progress payments in project scheduling problems., Subdivision of simplices relative to a cutting plane and finite concave minimization, Repulsion-based p-dispersion with distance constraints in non-convex polygons, The simple plant location problem: Survey and synthesis, Uncapacitated and Capacitated Facility Location Problems, An algorithm for a concave production cost network flow problem, Facility location with increasing production costs
