The following pages link to SCIP (Q13835):
Displaying 50 items.
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
- Production-process optimization algorithm: application to fed-batch bioprocess (Q682728) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- A system to evaluate gas network capacities: concepts and implementation (Q723970) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Exploiting symmetries in mathematical programming via orbital independence (Q829174) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← 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)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Convex reformulations for solving a nonlinear network design problem (Q902090) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems (Q907134) (← links)
- Integer linear programming models for topology optimization in sheet metal design (Q953299) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- LP-oriented upper bounds for the weighted stability number of a graph (Q1040359) (← links)
- Feasibility pump 2.0 (Q1043854) (← 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)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- A group analysis using the multiregression dynamic models for fMRI networked time series (Q1644426) (← 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)
- A global MINLP approach to symbolic regression (Q1650769) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
