The following pages link to XPRESS (Q16992):
Displaying 50 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Stochastic integer programming models for reducing wastages and shortages of blood products at hospitals (Q337351) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges (Q339664) (← links)
- Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
- Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Vehicle routing problem for fashion supply chains with cross-docking (Q460500) (← links)
- CVaR norm and applications in optimization (Q476266) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- Profit maximization and reduction of the cannibalization effect in chain expansion (Q512981) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- Shift-and-propagate (Q524884) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
- How much do we ``pay'' for using default parameters? (Q626650) (← links)
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
- Securing home health care in times of natural disasters (Q647524) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- OR software (Q721672) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Calculation of the Prokhorov distance by optimal quantization and maximum flow (Q734428) (← links)
- Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry (Q742505) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Polynomial-time identification of robust network flows under uncertain arc failures (Q839810) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Simulation and optimization of supply chains: Alternative or complementary approaches? (Q1017954) (← links)
