SCIP

swMATH1091MaRDI QIDQ13835

No author found.

Described by source

No records found.

Related Items (only showing first 100 items - show all)

Improving branch-and-cut performance by random sampling ⋮ Optimizing liner shipping fleet repositioning plans ⋮ Constraint programming and operations research ⋮ Searching multiregression dynamic models of resting-state fMRI networks using integer programming ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Transformation-based preprocessing for mixed-integer quadratic programs ⋮ A polyhedral investigation of star colorings ⋮ Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations ⋮ Mathematical programming techniques in water network optimization ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes ⋮ A group analysis using the multiregression dynamic models for fMRI networked time series ⋮ The ring tree facility location problem ⋮ A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows ⋮ Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ Grid parallelizing of discrete optimization problems with quasi-block structure matrices ⋮ A global MINLP approach to symbolic regression ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Theoretical challenges towards cutting-plane selection ⋮ A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem ⋮ Scheduling the professional Ecuadorian football league by integer programming ⋮ Recursive central rounding for mixed integer programs ⋮ A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem ⋮ A column generation approach for the location-routing problem with time windows ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Philosophy of the MiniZinc challenge ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ An improved test set approach to nonlinear integer problems with applications to engineering design ⋮ A constraint-based local search backend for MiniZinc ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Minimal counterexamples for linear-time probabilistic verification ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ On \(\alpha\)-roughly weighted games ⋮ Orbitopal fixing ⋮ Finding all solutions of separable systems of piecewise-linear equations using integer programming ⋮ Convex reformulations for solving a nonlinear network design problem ⋮ Progress in presolving for mixed integer programming ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Clique-based facets for the precedence constrained knapsack problem ⋮ A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems ⋮ A space-indexed formulation of packing boxes into a larger box ⋮ Branching on nonchimerical fractionalities ⋮ Optimized load planning of trains in intermodal transportation ⋮ Enhanced mixed integer programming techniques and routing problems ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Extended formulations for convex envelopes ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ Solving the minimum label spanning tree problem by mathematical programming techniques ⋮ A risk-averse stochastic program for integrated system design and preventive maintenance planning ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Stanley depth and simplicial spanning trees ⋮ The location-dispatching problem: polyhedral results and content delivery network design ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ Integer linear programming for the Bayesian network structure learning problem ⋮ Integer linear programming models for topology optimization in sheet metal design ⋮ Production-process optimization algorithm: application to fed-batch bioprocess ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Generalized coefficient strengthening cuts for mixed integer programming ⋮ Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade ⋮ Differentiable McCormick relaxations ⋮ Three enhancements for optimization-based bound tightening ⋮ Shift-and-propagate ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ Computational optimization of gas compressor stations: MINLP models versus continuous reformulations ⋮ 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 ⋮ ZI round, a MIP rounding heuristic ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Experiments on virtual private network design with concave capacity costs ⋮ A system to evaluate gas network capacities: concepts and implementation ⋮ Speeding up column generation for robust wireless network planning ⋮ On the safety of Gomory cut generators ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ RENS. The optimal rounding ⋮ The Schläfli Fan ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ LP-oriented upper bounds for the weighted stability number of a graph ⋮ Feasibility pump 2.0 ⋮ Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints

This page was built for software: SCIP