The following pages link to (Q5241193):
Displaying 47 items.
- Parallelization of the FICO Xpress-Optimizer (Q4637828) (← links)
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (Q4637829) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets (Q5087741) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Bin Packing Problem with Time Lags (Q5106420) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Rounding and Propagation Heuristics for Mixed Integer Programming (Q5176284) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection (Q5387636) (← links)
- Heuristics of the Branch-Cut-and-Price-Framework SCIP (Q5391872) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Adaptive cut selection in mixed-integer linear programming (Q6168887) (← links)
- Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- Using multiple reference vectors and objective scaling in the feasibility pump (Q6491331) (← links)
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
- A combined variable aggregation presolving technique for mixed integer programming (Q6564293) (← links)
- Learning to optimize: a tutorial for continuous and mixed-integer optimization (Q6564763) (← links)
- Enhancing cut selection through reinforcement learning (Q6564771) (← links)
- On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
