Pages that link to "Item:Q1433660"

The following pages link to Models for representing piecewise linear cost functions (Q1433660):

Displaying 41 items.

• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
• Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Post-pruning in decision tree induction using multiple performance measures (Q883297) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
• 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
• Global optimization for transport network expansion and signal setting (Q1665561) (← links)
• Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs (Q1728495) (← links)
• Integer programming for urban design (Q1755415) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
• Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
• Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator (Q2200714) (← links)
• A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
• Models and strategies for efficiently determining an optimal vertical alignment of roads (Q2257359) (← links)
• Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
• Fast feasibility check of the multi-material vertical alignment problem in road design (Q2301147) (← links)
• Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
• Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
• Global optimization of non-convex piecewise linear regression splines (Q2399484) (← links)
• A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
• Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
• Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Convex Relaxations for Gas Expansion Planning (Q2960359) (← links)
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
• Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation (Q3627693) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
• An algorithm for piece-wise indefinite quadratic programming problem (Q5147642) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• An efficient approach for the S‐shaped penalty function (Q6070432) (← links)
• An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem (Q6181252) (← links)