scientific article; zbMATH DE number 3550467

zbMATH Open0353.90062MaRDI QIDQ4124606FDOQ4124606

Authors: H. P. Williams 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)

Cited In (28)

• A Canonical Representation of Simple Plant Location Problems and Its Applications
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Mixed-integer bilinear programming problems
• Some aspects of integer programming duality
• Representability in mixed integer programming. I: Characterization results
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
• Fractional 0-1 programming: applications and algorithms
• Compact LP bases for a class of IP problems
• 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
• Representability of functions
• Bibliography in fractional programming
• Global solution of optimization problems with signomial parts
• Mixed integer linear programming formulation techniques
• An implementation of the simplex method for linear programming problems with variable upper bounds
• 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
• A direct dual method for the mixed plant location problem with some side constraints
• Facets for node packing
• Solving the anti-covering location problem using Lagrangian relaxation
• Reducing the number of variables in integer and linear programming problems
• Constructing integer programming models by the predicate calculus
• Facility siting and integer-friendly programming
• The splitting of variables and constraints in the formulation of integer programming models
• Tools for reformulating logical forms into zero-one mixed integer programs
• LP extreme points and cuts for the fixed-charge network design problem
• Heuristics and their design: A survey
• Logical processing for integer programming

This page was built for publication:

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