Pages that link to "Item:Q4079319"
From MaRDI portal
The following pages link to Analysis of mathematical programming problems prior to applying the simplex algorithm (Q4079319):
Displaying 50 items.
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems (Q301110) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Explicit model predictive control: a connected-graph approach (Q503150) (← links)
- Shift-and-propagate (Q524884) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
- Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- A computational intelligence method for solving a class of portfolio optimization problems (Q894382) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Constraint propagation, relational arithmetic in AI systems and mathematical programs (Q918408) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
- A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
- A constraint selection technique for a class of linear programs (Q1105487) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Balance constraints reduction of large-scale linear programming problems (Q1309865) (← links)
- Well management in the North Sea (Q1309889) (← links)
- Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
- Tools for reformulating logical forms into zero-one mixed integer programs (Q1317155) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Reducing the number of variables in integer and linear programming problems (Q1326508) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- A note on a maximum distance problem (Q1342943) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- Redundancy elimination with a lexicographic solved form (Q1380440) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Analysis of structure in fuzzy linear programs (Q1814624) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- A constraint selection technique in limit analysis (Q1823877) (← links)
- A pathological case in the reduction of linear programs (Q1837107) (← links)
- A statistical generalized programming algorithm for stochastic optimization problems (Q1904722) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
