scientific article; zbMATH DE number 3550467
From MaRDI portal
Publication:4124606
zbMath0353.90062MaRDI QIDQ4124606
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)
Related Items
Reducing the number of variables in integer and linear programming problems, A Canonical Representation of Simple Plant Location Problems and Its Applications, Representability in mixed integer programming. I: Characterization results, Solving the anti-covering location problem using Lagrangian relaxation, A direct dual method for the mixed plant location problem with some side constraints, Fractional 0-1 programming: applications and algorithms, A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, Some aspects of integer programming duality, LP extreme points and cuts for the fixed-charge network design problem, Heuristics and their design: A survey, Constructing integer programming models by the predicate calculus, Global solution of optimization problems with signomial parts, Analysis of mathematical programming problems prior to applying the simplex algorithm, Mixed-integer bilinear programming problems, Compact LP bases for a class of IP problems, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, The reformulation of two mixed integer programming problems, A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem, Mixed Integer Linear Programming Formulation Techniques, Facility siting and integer-friendly programming, The splitting of variables and constraints in the formulation of integer programming models, Facets for node packing, Representability of functions, An implementation of the simplex method for linear programming problems with variable upper bounds, Tools for reformulating logical forms into zero-one mixed integer programs, Bibliography in fractional programming, Logical processing for integer programming
