The following pages link to (Q5241193):
Displaying 50 items.
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- A group analysis using the multiregression dynamic models for fMRI networked time series (Q1644426) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (Q1683090) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Advances in verification of ReLU neural networks (Q2046329) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Optimal operation of transient gas transport networks (Q2139136) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Generative deep learning for decision making in gas networks (Q2155386) (← links)
- Adapting the \textit{ng}-path relaxation for bike balancing problems (Q2157885) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Conference scheduling: a clustering-based approach (Q2242187) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (Q2250081) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Tight convex relaxations for the expansion planning problem (Q2671451) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- (Q4577935) (← links)
- 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)
