The following pages link to SCIP (Q13835):
Displaying 50 items.
- The Schläfli Fan (Q161345) (← links)
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Optimizing liner shipping fleet repositioning plans (Q269936) (← links)
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming (Q273610) (← links)
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- Transformation-based preprocessing for mixed-integer quadratic programs (Q283953) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Mathematical programming techniques in water network optimization (Q319201) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes (Q323373) (← links)
- The ring tree facility location problem (Q324831) (← links)
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- Scheduling the professional Ecuadorian football league by integer programming (Q336548) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem (Q338811) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- On \(\alpha\)-roughly weighted games (Q403979) (← links)
- Orbitopal fixing (Q408377) (← links)
- Finding all solutions of separable systems of piecewise-linear equations using integer programming (Q413729) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Optimized load planning of trains in intermodal transportation (Q443814) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- Stanley depth and simplicial spanning trees (Q494301) (← links)
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade (Q519013) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Shift-and-propagate (Q524884) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings (Q532932) (← links)
- Philosophy of the MiniZinc challenge (Q606904) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
