SCIP

swMATH1091MaRDI QIDQ13835FDOQ13835

Author name not available (Why is that?)

Described by source

• Analyzing the computational impact of MIQCP solver components
• Extending a CIP framework to solve MIQCPs
• Heuristics of the branch-cut-and-price-framework SCIP
• SCIP: solving constraint integer programs

Cited In (only showing first 100 items - show all)

• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• Mixed-integer linear programming heuristics for the prepack optimization problem
• Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
• Simulated annealing approach to nurse rostering benchmark and real-world instances
• A dynamic programming approach for the pipe network layout problem
• Computing feasible points for binary MINLPs with MPECs
• Complete mixed integer linear programming formulations for modularity density based clustering
• Tighter McCormick relaxations through subgradient propagation
• Active set methods with reoptimization for convex quadratic integer programming
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• A column generation approach for the location-routing problem with time windows
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Exploiting symmetry in integer convex optimization using core points
• Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
• A configuration model for the line planning problem
• A group analysis using the multiregression dynamic models for fMRI networked time series
• Global solution of non-convex quadratically constrained quadratic programs
• Studying the effective brain connectivity using multiregression dynamic models
• A robust and scalable algorithm for the Steiner problem in graphs
• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• On the Performance of NLP Solvers Within Global MINLP Solvers
• A decision-making tool for energy efficiency optimization of street lighting
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• SelfSplit parallelization for mixed-integer linear programming
• Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
• Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
• On decomposability of multilinear sets
• Solving MIPs via scaling-based augmentation
• Experimental validation of volume-based comparison for double-McCormick relaxations
• Learning when to use a decomposition
• Decomposition methods for the parallel machine scheduling problem with setups
• A computational study of global optimization solvers on two trust region subproblems
• A customized branch-and-bound approach for irregular shape nesting
• A data-driven, variable-speed model for the train timetable rescheduling problem
• Integer programming models for the multidimensional assignment problem with star costs
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Guided dive for the spatial branch-and-bound
• LMHS: a SAT-IP hybrid MaxSat solver
• The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints
• An abstract model for branching and its application to mixed integer programming
• Virtuous smoothing for global optimization
• Computing maximal copies of polyhedra contained in a polyhedron
• Enumerating neighborly polytopes and oriented matroids
• Compact extended linear programming models
• Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
• Domain reduction techniques for global NLP and MINLP optimization
• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
• A generic optimization framework for resilient systems
• Integrating operations research in constraint programming
• Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
• Pitfalls and best practices in algorithm configuration
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• QPLIB: a library of quadratic programming instances
• Solving linear programs with complementarity constraints using branch-and-cut
• Improving branch-and-cut performance by random sampling
• \textsc{OptiMathSAT}: a tool for optimization modulo theories
• Metric hybrid factored planning in nonlinear domains with constraint generation
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Wombit: a portfolio bit-vector solver using word-level propagation
• Optimizing liner shipping fleet repositioning plans
• Searching multiregression dynamic models of resting-state fMRI networks using integer programming
• Parallelization of the FICO Xpress-Optimizer
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• The Schläfli Fan
• Algorithm runtime prediction: methods \& evaluation
• On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
• Transformation-based preprocessing for mixed-integer quadratic programs
• A polyhedral investigation of star colorings
• Bayesian network structure learning with integer programming: polytopes, facets and complexity
• Feasibility pump 2.0
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• 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
• A new mathematical model for tiling finite regions of the plane with polyominoes
• Column Generation
• A flag vector of a 3-sphere that is not the flag vector of a 4-polytope
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Estimating causal structure using conditional DAG models
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Constraint programming-based column generation
• Computing convex hulls and counting integer points with \texttt{polymake}
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Mathematical programming techniques in water network optimization
• A branch-cut-and-price algorithm for the piecewise linear transportation problem
• Recursive central rounding for mixed integer programs
• Extended formulations for convex envelopes
• Noncommercial software for mixed-integer linear programming
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• Strict linear prices in non-convex European day-ahead electricity markets
• Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Algorithm 996
• A polyhedral approach to the \textit{alldifferent} system
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• PolySCIP
• A brief history of linear and mixed-integer programming computation
• Measuring the impact of primal heuristics

This page was built for software: SCIP