Analysis of mathematical programming problems prior to applying the simplex algorithm

Cites work

scientific article; zbMATH DE number 3521444 (Why is no real title available?)
scientific article; zbMATH DE number 3520148 (Why is no real title available?)
scientific article; zbMATH DE number 3550467 (Why is no real title available?)
scientific article; zbMATH DE number 3438384 (Why is no real title available?)
An Additive Algorithm for Solving Linear Programs with Zero-One Variables

Cited in

(76)

Interactions between nonlinear programming and modeling systems
Broadening the integer programming audience, the LINDO perspective
Mixed integer programming: A historical perspective with Xpress-MP
Progress in presolving for mixed integer programming
Computational aspects of infeasibility analysis in mixed integer programming
A heuristic algorithm for resource allocation/reallocation problem
Efficient preprocessing for VLSI optimization problems
Discovering the Characteristics of Mathematical Programs via Sampling
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
A constraint selection technique in limit analysis
Detecting embedded pure network structures in LP problems
Tighter McCormick relaxations through subgradient propagation
Coefficient strengthening: a tool for reformulating mixed-integer programs
A pathological case in the reduction of linear programs
A statistical generalized programming algorithm for stochastic optimization problems
Analysis of structure in fuzzy linear programs
Presolving in linear programming
On free variables in interior point methods
Experiments with conflict analysis in mixed integer programming
Dynamic factorization in large-scale optimization
IntSat: integer linear programming by conflict-driven constraint learning
The BPMPD interior point solver for convex quadratic problems
Conflict-Driven Heuristics for Mixed Integer Programming
\(O(n \log n)\) procedures for tightening cover inequalities
Extracting embedded generalized networks from linear programming problems
Automatic identification of embedded network rows in large-scale optimization models
Formal optimization of some reduced linear programming problems
Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
Preprocessing and cutting planes with conflict graphs
Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
A linear and discrete programming framework for representing qualitative knowledge
Balance constraints reduction of large-scale linear programming problems
Solving integer programs with a few important binary gub constraints
Well management in the North Sea
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
Combinatorial optimization: current successes and directions for the future
Ten years of feasibility pump, and counting
Constraint propagation, relational arithmetic in AI systems and mathematical programs
Robust preliminary analysis of large-scale linear model for optimal industrial investments
Solving large-scale mixed-integer programs with fixed charge variables
Hit-and-run algorithms for the identification of nonredundant linear inequalities
A comparative study of redundant constraints identification methods in linear programming problems
Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
Presolve Reductions in Mixed Integer Programming
Stronger formulations of mixed integer linear programs: an example
A constraint selection technique for a class of linear programs
Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
Solving continuous and discrete nonlinear programs with BARON
A hierarchical algorithm for making sparse matrices sparser
A combined linear and nonlinear presolve for nonlinear optimization
A note on a maximum distance problem
A computational intelligence method for solving a class of portfolio optimization problems
Reducing the number of variables in integer and linear programming problems
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
Constructing integer programming models by the predicate calculus
Advances in design and implementation of optimization software
A heuristic approach for identification of redundant constraints in linear programming models
Explicit model predictive control: a connected-graph approach
MOPS -- Mathematical optimization system
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Tools for reformulating logical forms into zero-one mixed integer programs
Supernode processing of mixed-integer models
A computational study of redundancy in randomly generated polytopes
Domain reduction techniques for global NLP and MINLP optimization
Redundancy elimination with a lexicographic solved form
Some properties of cliques in 0-1 mixed integer programs
Branch and bound with estimation based on pseudo-shadow-prices
Optimizing over three-dimensional subspaces in an interior-point method for linear programming
Extracting pure network submatrices in linear programs using signed graphs.
Deletion presolve for accelerating infeasibility diagnosis in optimization models
A possible way to reduce degeneracy in integer programming computations
Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
Screening rules and its complexity for active set identification
Computational experience with a primal-dual interior point method for linear programming
Shift-and-propagate

This page was built for publication: Analysis of mathematical programming problems prior to applying the simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079319)