SCICONIC

swMATH1087MaRDI QIDQ13831FDOQ13831

Author name not available (Why is that?)

Cited In (29)

• Algebraic languages for mathematical programming
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Presolving in linear programming
• Formulation of a problem involving assembly lines with multiple manning of work stations
• Title not available (Why is that?)
• Optimization methods for petroleum fields development and production systems: a review
• Solving integer programs with a few important binary gub constraints
• Well management in the North Sea
• Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion
• Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
• An algorithm for disjunctive programs
• Some branch and bound techniques for nonlinear optimization
• Investment planning for urban roads
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation
• A heuristic for multi-level lot-sizing problems with a bottleneck
• A phase-1 approach for the generalized simplex algorithm
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms
• A dual approach to primal degeneracy
• Generating cuts in integer programming with families of special ordered sets
• A basis-defiency-allowing variation of the simplex method for linear programming
• Formulation of multiple-choice situations in linear programming models using binary coding matrices
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
• An integer programming model for the allocation of databases in a distributed computer system
• Branch and bound with estimation based on pseudo-shadow-prices
• Covering the classroom requirements for the schools of Hamburg
• A possible way to reduce degeneracy in integer programming computations
• Strong formulations for mixed integer programming: A survey

This page was built for software: SCICONIC