The following pages link to MIPLIB (Q16254):
Displaying 50 items.
- polyDB: A Database for Polytopes and Related Objects (Q161321) (← links)
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Using the analytic center in the feasibility pump (Q408384) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
- A variable depth search branching (Q453047) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- Shift-and-propagate (Q524884) (← links)
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Branching on general disjunctions (Q543420) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- Application-oriented mixed integer non-linear programming (Q607876) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- How much do we ``pay'' for using default parameters? (Q626650) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- Heuristic algorithms for the inverse mixed integer linear programming problem (Q652705) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
