The following pages link to SCICONIC (Q13831):
Displaying 29 items.
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Branch and bound with estimation based on pseudo-shadow-prices (Q805497) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Formulation of multiple-choice situations in linear programming models using binary coding matrices (Q1058985) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
- Some branch and bound techniques for nonlinear optimization (Q1100098) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- Algebraic languages for mathematical programming (Q1261394) (← links)
- Well management in the North Sea (Q1309889) (← links)
- Solving integer programs with a few important binary gub constraints (Q1309895) (← links)
- Investment planning for urban roads (Q1322152) (← links)
- Covering the classroom requirements for the schools of Hamburg (Q1374417) (← links)
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Optimization methods for petroleum fields development and production systems: a review (Q1642989) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks (Q2368099) (← links)
- A heuristic for multi-level lot-sizing problems with a bottleneck (Q3356031) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- Formulation of a problem involving assembly lines with multiple manning of work stations (Q3707757) (← links)
- The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation (Q3738859) (← links)
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion (Q3901311) (← links)
- (Q4836359) (← links)
