Pages that link to "Item:Q1295962"

The following pages link to A production-transportation problem with stochastic demand and concave production costs (Q1295962):

Displaying 23 items.

• A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels (Q287653) (← links)
• Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
• Solving DC programs using the cutting angle method (Q486726) (← links)
• A transportation planning problem with transfer costs in uncertain environment (Q781327) (← links)
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
• Service system design with immobile servers, stochastic demand and concave-cost capacity selection (Q1652604) (← links)
• An uncertain programming for the integrated planning of production and transportation (Q1718332) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• Exact solution methods for uncapacitated location problems with convex transportation costs (Q1809831) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
• A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
• Solving the production transportation problem via a deterministic annealing neural network method (Q2245991) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
• Mean value cross decomposition for nonlinear convex problems (Q5475282) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)