Pages that link to "Item:Q2349121"

The following pages link to On mathematical programming with indicator constraints (Q2349121):

Displaying 44 items.

• Nonlinear chance constrained problems: optimality conditions, regularization and solvers (Q306384) (← links)
• An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)
• Models and algorithms for optimising two-dimensional LEGO constructions (Q2028820) (← links)
• Optimization problems for machine learning: a survey (Q2029894) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Interval-based stochastic dominance: theoretical framework and application to portfolio choices (Q2070730) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
• Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
• Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
• On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← 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)
• On handling indicator constraints in mixed integer programming (Q2374361) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• (Q4998944) (← links)
• Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
• On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
• A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Strong mixed-integer programming formulations for trained neural networks (Q5918909) (← links)
• \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
• New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application (Q6063807) (← links)
• The continuous quadrant penalty formulation of logical constraints (Q6068284) (← links)
• Deep Neural Networks Pruning via the Structured Perspective Regularization (Q6148352) (← links)
• Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
• An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
• Mathematical programming for simultaneous feature selection and outlier detection under l1 norm (Q6565451) (← links)
• Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics (Q6584339) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• Robust bilevel optimization for near-optimal lower-level solutions (Q6635807) (← links)
• Destination selection and flight scheduling for regional airlines at slot-constrained airports (Q6659820) (← links)