Pages that link to "Item:Q734351"

The following pages link to SCIP: solving constraint integer programs (Q734351):

Displaying 50 items.

• Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
• A constraint-based local search backend for MiniZinc (Q890003) (← links)
• Convex reformulations for solving a nonlinear network design problem (Q902090) (← links)
• Progress in presolving for mixed integer programming (Q903920) (← links)
• A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems (Q907134) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Grid parallelizing of discrete optimization problems with quasi-block structure matrices (Q1647410) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
• 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)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• A customized branch-and-bound approach for irregular shape nesting (Q1668808) (← links)
• Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances (Q1680815) (← 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)
• 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)
• Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← 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)
• A study on the 3D position estimation of ventricular borders extracted from 2D echocardiography data (Q1732390) (← 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)
• Metric inequalities for routings on direct connections with application to line planning (Q1751129) (← 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)
• 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)
• Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• Strategic uncertainty in markets for nonrenewable resources: a level-\(k\) approach (Q1784861) (← links)
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)