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
• Enumerating Neighborly Polytopes and Oriented Matroids
• 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
• A Configuration Model for the Line Planning Problem
• 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
• 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 group analysis using the multiregression dynamic models for fMRI networked time series
• Global solution of non-convex quadratically constrained quadratic programs
• Computing Maximal Copies of Polyhedra Contained in a Polyhedron
• 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
• Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
• 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
• Active Set Methods with Reoptimization for Convex Quadratic Integer Programming
• 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
• 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
• 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
• LMHS: A SAT-IP Hybrid MaxSAT Solver
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
• Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
• Mixed integer nonlinear programming tools: a practical overview
• 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
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
• Exact Approaches for Network Design Problems with Relays
• Progress in presolving for mixed integer programming
• Chapter 5: Mathematical optimization for evaluating gas network capacities
• Computational aspects of infeasibility analysis in mixed integer programming
• Detecting orbitopal symmetries
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• Rapid learning for binary programs
• Chapter 7: The specialized MINLP approach
• LP-oriented upper bounds for the weighted stability number of a graph
• Experiments on virtual private network design with concave capacity costs
• A system to evaluate gas network capacities: concepts and implementation
• Could we use a million cores to solve an integer program?
• Theoretical challenges towards cutting-plane selection
• Improved branch-cut-and-price for capacitated vehicle routing
• Integrated sequencing and scheduling in coil coating
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
• A relax-and-cut framework for Gomory's mixed-integer cuts
• Optimization Modulo Theories with Linear Rational Costs
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
• Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• On the safety of Gomory cut generators
• Speeding up column generation for robust wireless network planning
• Mixed integer linear programming formulation techniques
• Graphical models for optimal power flow
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios
• Presolve Reductions in Mixed Integer Programming
• The rankability of weighted data from pairwise comparisons
• Practical and efficient algorithms for the geometric hitting set problem
• Mathematical Programming Models and Exact Algorithms
• Three ideas for a feasibility pump for nonconvex MINLP
• Title not available (Why is that?)
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

This page was built for software: SCIP