Pages that link to "Item:Q543399"
From MaRDI portal
The following pages link to Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399):
Displaying 50 items.
- Optimistic MILP modeling of non-linear optimization problems (Q297051) (← links)
- Mathematical programming techniques in water network optimization (Q319201) (← 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)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions (Q887097) (← links)
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
- Global optimization for transport network expansion and signal setting (Q1665561) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation (Q1695038) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Optimizing invasive species management: a mixed-integer linear programming approach (Q1751811) (← links)
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem (Q1752849) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks (Q1954655) (← links)
- Three methods for robust grading (Q1991142) (← links)
- Railway delay management with passenger rerouting considering train capacity constraints (Q2028881) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- Non-convex nested Benders decomposition (Q2097672) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- An elastic demand model for locating electric vehicle charging stations (Q2148145) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- An integrated planning model in centralized power systems (Q2189954) (← links)
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Fuzzy score technique for the optimal location of wind turbines installations (Q2284707) (← links)
- Optimal influenza vaccine distribution with equity (Q2286989) (← links)
- A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP (Q2331363) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
