The following pages link to (Q4421360):
Displayed 35 items.
- An exact penalty function based on the projection matrix (Q278572) (← links)
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach (Q337234) (← links)
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- DrAmpl: A meta solver for optimization problem analysis (Q601972) (← links)
- Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices (Q725507) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- Integration of strategic and tactical decisions for vendor selection under capacity constraints (Q991379) (← links)
- The bandpass problem: Combinatorial optimization and library of problems (Q1037450) (← links)
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← links)
- Scenario reduction for stochastic programs with conditional value-at-risk (Q1650782) (← links)
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (Q1683090) (← links)
- Logistic regression: from art to science (Q1750250) (← links)
- Structured low rank approximation (Q1874666) (← links)
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
- Polynomial programming prevents aircraft (and other) conflicts (Q2060568) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- A penalty approach to linear programs with many two-sided constraints (Q2117633) (← links)
- A Chebyshev technique for the solution of optimal control problems with nonlinear programming methods (Q2228757) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Design and dispatch optimization of a solid-oxide fuel cell assembly for unconventional oil and gas production (Q2315097) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- Dynamic programming with Hermite approximation (Q2354012) (← links)
- The optimization test environment (Q2357211) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Test-sequence optimisation by survival analysis (Q2418154) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints (Q2806828) (← links)
- Parallel GEAs with Linkage Analysis over Grid (Q3539202) (← links)
- Results on the domination number and the total domination number of Lucas cubes (Q4993941) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- On the domination number and the total domination number of Fibonacci cubes (Q5225037) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)