Pages that link to "Item:Q4404695"

The following pages link to Optimal Facility Location with Concave Costs (Q4404695):

Displaying 49 items.

• Supply chain design considering economies of scale and transport frequencies (Q439589) (← links)
• Internet shopping with price sensitive discounts (Q457290) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• 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 (Q704135) (← links)
• The telephonic switching centre network problem: Formalization and computational experience (Q1093558) (← links)
• A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
• An algorithm for the min concave cost flow problem (Q1142707) (← links)
• Algorithms for parametric nonconvex programming (Q1158344) (← links)
• Locational analysis (Q1173002) (← links)
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure (Q1184354) (← links)
• Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
• Concave cost minimization on networks (Q1257417) (← links)
• An algorithm for a concave production cost network flow problem (Q1301576) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection (Q1652604) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
• Progress payments in project scheduling problems. (Q1812008) (← links)
• Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
• Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
• A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• An integrated plant loading model with economies of scale and scope (Q2641217) (← links)
• A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
• Minimizing a sum of staircase functions under linear constraints (Q3796985) (← links)
• Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
• Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (Q3892089) (← links)
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY (Q3964470) (← links)
• Stochastic allocation of inspection capacity to competitive processes (Q4539886) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• Uncapacitated and Capacitated Facility Location Problems (Q5506717) (← links)
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
• Modeling and solving an economies‐of‐scale service system design problem (Q6187314) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)