Pages that link to "Item:Q5897037"
From MaRDI portal
The following pages link to Global Optimization and Constraint Satisfaction (Q5897037):
Displaying 21 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Global optimization and constraint satisfaction. First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2--4, 2002. Revised selected papers (Q1418477) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study (Q1881050) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints (Q1935885) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk (Q2514882) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- (Q4552725) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (Q5963234) (← links)