scientific article
From MaRDI portal
Publication:2712822
zbMath0986.90025MaRDI QIDQ2712822
Edward Rothberg, Mary Fenelon, Zhonghao Gu, Roland Wunderling, Robert E. Bixby
Publication date: 16 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
experimental resultsdual simplex methodCPLEXfast pricing updatelevel-two cachemixed-integer-programsordering algorithms for Cholesky factorization
Related Items (56)
Dynamic unit commitment problem of controlling a power system in a competitive electricity market ⋮ A global optimization problem in portfolio selection ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Optimizing multiple qualifications of products on non-identical parallel machines ⋮ ILP approaches to the blockmodel problem ⋮ An interior-point approach for primal block-angular problems ⋮ Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs ⋮ A Linear-Programming Approximation of AC Power Flows ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Matheuristics: survey and synthesis ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ A heuristic to generate rank-1 GMI cuts ⋮ Computing with Multi-row Gomory Cuts ⋮ Progress in mathematical programming solvers from 2001 to 2020 ⋮ A variable neighborhood decomposition search method for supply chain management planning problems ⋮ On solving the progressive party problem as a MIP. ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Implementation of an interior point method with basis preconditioning ⋮ Measuring the impact of primal heuristics ⋮ Counting Solutions of Integer Programs Using Unrestricted Subtree Detection ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ The mixing-MIR set with divisible capacities ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Shift-and-propagate ⋮ Relations between facets of low- and high-dimensional group problems ⋮ Progress in computational mixed integer programming -- a look back from the other side of the tipping point ⋮ Computing with multi-row gomory cuts ⋮ Towards a practical parallelisation of the simplex method ⋮ A first look at picking dual variables for maximizing reduced cost fixing ⋮ Exploring relaxation induced neighborhoods to improve MIP solutions ⋮ Hyper-sparsity in the revised simplex method and how to exploit it ⋮ A hierarchical method for discrete structural topology design problems with local stress and displacement constraints ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ Faster MIP solutions via new node selection rules ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ Solving convex MINLP optimization problems using a sequential cutting plane algorithm ⋮ QPLIB: a library of quadratic programming instances ⋮ Hybrid systems modeling and control ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ RENS. The optimal rounding ⋮ Valid inequalities for mips and group polyhedra from approximate liftings ⋮ A generalized dual phase-2 simplex algorithm. ⋮ Challenges in Enterprise Wide Optimization for the Process Industries ⋮ Computational aspects of infeasibility analysis in mixed integer programming ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ Optimization of order policies in supply networks ⋮ Conflict-Driven Heuristics for Mixed Integer Programming ⋮ An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method ⋮ Valid inequalities based on simple mixed-integer sets ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem ⋮ Logical processing for integer programming
Uses Software
This page was built for publication:
