Pages that link to "Item:Q2374361"
From MaRDI portal
The following pages link to On handling indicator constraints in mixed integer programming (Q2374361):
Displaying 27 items.
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- Deep neural networks and mixed integer linear optimization (Q1617390) (← links)
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← 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)
- Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy (Q2076831) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand (Q2171597) (← links)
- Tightening big Ms in integer programming formulations for support vector machines with ramp loss (Q2184093) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Adversarial classification via distributional robustness with Wasserstein ambiguity (Q2693647) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints (Q5147029) (← links)
- An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems (Q5882416) (← links)
- Strong mixed-integer programming formulations for trained neural networks (Q5918909) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
- The continuous quadrant penalty formulation of logical constraints (Q6068284) (← links)
- Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations (Q6168498) (← links)
