Pages that link to "Item:Q3114873"

The following pages link to A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (Q3114873):

Displaying 22 items.

• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Multiattribute electronic procurement using goal programming (Q858469) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
• A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
• 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
• An effective linear approximation method for separable programming problems (Q1036545) (← links)
• The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
• Exact algorithms for integrated facility location and production planning problems (Q5198685) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
• Eco-routing problem for the delivery of perishable products (Q6109571) (← links)
• An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem (Q6181252) (← links)