Results 311 to 320 of about 6,356,541 (351)
Some of the next articles are maybe not open access.
Strong mixed-integer programming formulations for trained neural networks
Mathematical programming, 2018We present strong mixed-integer programming (MIP) formulations for high-dimensional piecewise linear functions that correspond to trained neural networks.
Ross Anderson +4 more
semanticscholar +1 more source
An integer linear programming approach for bilinear integer programming [PDF]
Operations Research Letters, 2012 We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling
Alexandre S. Freire +2 more
openaire +1 more source
Computational integer programming
Mathematical Programming, 1998The articles of this volume will be reviewed individually.
William J. Cook, Daniel Bienstock
openaire +2 more sources
On Integer Programming and Convolution
Information Technology Convergence and Services, 2018Integer programs with a fixed number of constraints can be solved in pseudo-polynomial time. We present a surprisingly simple algorithm and matching conditional lower bounds. Consider an IP in standard form $\max\{c^T x : A x = b, x\in \mathbb Z^n_{\ge 0}
K. Jansen, Lars Rohwedder
semanticscholar +1 more source
On stochastic integer programming
Zeitschrift für Operations Research, 1975The probability distribution of the optimum (Z) of an integer linear program is discussed in which the elements of the right-hand-side (RHS) are distributed independently. The assumptions of the asymptotic algorithm ofGomory are supposed to hold for each realization of the RHS.
Hans-Jürgen Zimmermann +1 more
openaire +3 more sources
1980
Publisher Summary There are many problems in linear programming where the variables must assume only integer values. In some problems such as the transportation problem with integer values for supply and demand, the simplex method will yield integer answers; however, in many other problems, it will not.
BERNARD KOLMAN, ROBERT E. BECK
openaire +2 more sources
Publisher Summary There are many problems in linear programming where the variables must assume only integer values. In some problems such as the transportation problem with integer values for supply and demand, the simplex method will yield integer answers; however, in many other problems, it will not.
BERNARD KOLMAN, ROBERT E. BECK
openaire +2 more sources
Hyperbolic integer programming
Naval Research Logistics Quarterly, 1973AbstractThe hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set.
M. Grunspan, M. E. Thomas
openaire +2 more sources
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Management Sciences, 2004(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute of Management Sciences.) One of the most computationally useful ideas of the 1970s is the observation that many hard ...
M. Fisher
semanticscholar +1 more source
Optimization of Multilayer Optical Films with a Memetic Algorithm and Mixed Integer Programming
, 2017Multilayer optical films have been extensively used in optical technology, but the design of multilayer structures for broadband applications is often challenging due to the need to incorporate material dispersion. Here, we present an implementation of a
Yu Shi, Wei Li, A. Raman, S. Fan
semanticscholar +1 more source
Hyperspheric Integer Programming [PDF]
Studies in Applied Mathematics, 1973 This paper develops an efficient method for finding the optimal solution to linear mathematical programs on 0–1 variables.It is shown that the lattice (0–1) points satisfying some linear constraint of dimension n can equally be represented by those lying in a hypersphere of the same dimension.The lattice points satisfying two linear constraints can be ...
openaire +1 more source