The following pages link to SCIP (Q13835):
Displaying 50 items.
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- A decision-making tool for energy efficiency optimization of street lighting (Q1652679) (← links)
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces (Q1659620) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances (Q1680815) (← links)
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints (Q1681502) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (Q1698778) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Graphical models for optimal power flow (Q1701228) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Studying the effective brain connectivity using multiregression dynamic models (Q1705546) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- Consensus efficiency in group decision making: a comprehensive comparative study and its optimal design (Q1713751) (← links)
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- Deterministic global optimization with artificial neural networks embedded (Q1730780) (← links)
- A dynamic programming approach for the pipe network layout problem (Q1735166) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Metric inequalities for routings on direct connections with application to line planning (Q1751129) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) (← links)
- Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation (Q1751867) (← links)
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
- Linear models for stockpiling in open-pit mine production scheduling problems (Q1753425) (← links)
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
