Pages that link to "Item:Q3392024"

The following pages link to A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024):

Displaying 30 items.

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• Dual-mode production planning for manufacturing with emission constraints (Q322630) (← 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)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• A PLMF-based decomposition-coordination algorithm for fuzzy linear programming in industrial applications (Q1637770) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← 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)
• A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• Models and strategies for efficiently determining an optimal vertical alignment of roads (Q2257359) (← links)
• A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• Global optimization of non-convex piecewise linear regression splines (Q2399484) (← links)
• Scheduling for a processor sharing system with linear slowdown (Q2408895) (← links)
• A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
• A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← 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)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← 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)