The following pages link to (Q2712822):
Displaying 49 items.
- Dynamic unit commitment problem of controlling a power system in a competitive electricity market (Q295585) (← links)
- Shift-and-propagate (Q524884) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Logical processing for integer programming (Q817209) (← links)
- A global optimization problem in portfolio selection (Q839845) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
- Computing with multi-row gomory cuts (Q969515) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Optimization of order policies in supply networks (Q1039791) (← links)
- On solving the progressive party problem as a MIP. (Q1422363) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- A first look at picking dual variables for maximizing reduced cost fixing (Q2011594) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Optimizing multiple qualifications of products on non-identical parallel machines (Q2147099) (← links)
- Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- Measuring the impact of primal heuristics (Q2450740) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Hybrid systems modeling and control (Q2512279) (← links)
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method (Q2572861) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- A Linear-Programming Approximation of AC Power Flows (Q2940062) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Progress in mathematical programming solvers from 2001 to 2020 (Q6114935) (← links)
