Cited in
(only showing first 100 items - show all)- The Steiner connectivity problem
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- The symmetric quadratic traveling salesman problem
- High-level counterexamples for probabilistic automata
- A note on solving MINLP's using formulation space search
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Incorporating bounds from decision diagrams into integer programming
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Measuring the impact of branching rules for mixed-integer programming
- Faster MIP solutions via new node selection rules
- Linear models for stockpiling in open-pit mine production scheduling problems
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Non-convex nested Benders decomposition
- A framework for solving mixed-integer semidefinite programs
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- Pitfalls and best practices in algorithm configuration
- Minimal counterexamples for linear-time probabilistic verification
- Mixed integer nonlinear programming tools: a practical overview
- Primal Heuristics for Branch-and-Price Algorithms
- Generating subtour elimination constraints for the TSP from pure integer solutions
- 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
- 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
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Improving branch-and-cut performance by random sampling
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- Mixed-integer linear programming heuristics for the prepack optimization problem
- Optimal linear arrangements using betweenness variables
- Polyhedral approximation in mixed-integer convex optimization
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- QPLIB: a library of quadratic programming instances
- Solving linear programs with complementarity constraints using branch-and-cut
- Exploiting symmetries in mathematical programming via orbital independence
- Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Stabilizing branch-and-price for constrained tree problems
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Detecting critical node structures on graphs: a mathematical programming approach
- Progress in presolving for mixed integer programming
- Building optimal Steiner trees on supercomputers by using up to 43,000 cores
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- Metric hybrid factored planning in nonlinear domains with constraint generation
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Optimal design of periodic frame structures with negative thermal expansion via mixed integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- Integer linear programming models for topology optimization in sheet metal design
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- New integer linear programming models for the vertex coloring problem
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- Mathematical programming models and exact algorithms
- Using Model Counting to Find Optimal Distinguishing Tests
- Validation of nominations in gas network optimization: models, methods, and solutions
- Progress in Academic computational integer programming
- An L-shaped method with strengthened lift-and-project cuts
- An algorithm-independent measure of progress for linear constraint propagation
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Benchmarking optimization software -- a (Hi)story
- Optimizing liner shipping fleet repositioning plans
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- Exact computation of censored least absolute deviations estimator
- The biclique covering number of grids
- Wombit: a portfolio bit-vector solver using word-level propagation
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Constraint programming and operations research
- Branch-and-cut-and-price for multi-agent path finding
- A dynamic programming approach for the pipe network layout problem
- Parallelization of the FICO Xpress-Optimizer
- Computing feasible points for binary MINLPs with MPECs
- Optimization modulo theories with linear rational costs
- Detecting orbitopal symmetries
- Complete mixed integer linear programming formulations for modularity density based clustering
- Exactly solving a two-level location problem with modular node capacities
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- Optimal control of water distribution networks without storage
- Tighter McCormick relaxations through subgradient propagation
- A doubly nonnegative relaxation for modularity density maximization
- On the exact separation of cover inequalities of maximum-depth
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Heuristic approaches to the distinguishing substring selection problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- OptiLog: a framework for SAT-based systems
- Comments on: ``On learning and branching: a survey
- 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
This page was built for software: SCIP
