The following pages link to MIPLIB (Q16254):
Displaying 50 items.
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← 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)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Benchmarking optimization software -- a (Hi)story (Q2225640) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Global sensitivity analysis via a statistical tolerance approach (Q2239933) (← links)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (Q2250081) (← links)
- Cyclic and non-cyclic crew rostering problems in public bus transit (Q2260894) (← links)
- Self-scheduling of electric vehicles in an intelligent parking lot using stochastic optimization (Q2263614) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing (Q2273651) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Hierarchical solution of non-convex optimal control problems with application to autonomous driving (Q2335471) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Cutting to the chase. (Q2351157) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Verifying integer programming results (Q2401153) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- Measuring the impact of primal heuristics (Q2450740) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- The strength of multi-row models (Q2516350) (← links)
