Results 321 to 330 of about 6,356,541 (351)

Mixed-Integer Linear Programming for Optimal Scheduling of Autonomous Vehicle Intersection Crossing

IEEE Transactions on Intelligent Vehicles, 2018
We propose an urban traffic management scheme for an all connected vehicle environment. If all the vehicles are autonomous, for example, in smart city projects or future's dense city centers, then such an environment does not need a physical traffic ...
S. A. Fayazi, A. Vahidi
semanticscholar   +1 more source

A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

Operational Research, 2017
We examine bilevel mixed-integer programs whose constraints and objective functions depend on both upper- and lower-level variables. The class of problems we consider allows for nonlinear terms to appear in both the constraints and the objective ...
Leonardo Lozano, J. Smith
semanticscholar   +1 more source

Decentralized Diagnosis by Petri Nets and Integer Linear Programming

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2018
This paper proposes a novel decentralized on-line fault diagnosis approach based on the solution of some integer linear programming problems for discrete event systems in a Petri net framework.
Xuya Cong, M. P. Fanti, A. M. Mangini, Zhiwu Li   +3 more
semanticscholar   +1 more source

An Introduction to Two-Stage Stochastic Mixed-Integer Programming

, 2017
This paper provides an introduction to algorithms for two-stage stochastic mixed-integer programs. Our focus is on methods which decompose the problem by scenarios representing randomness in the problem data.
Simge Küçükyavuz, S. Sen
semanticscholar   +1 more source

Elementary closures for integer programs

Operations Research Letters, 2001
In integer programming, the elementary closure associated with a family of cuts is the convex set defined by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two ...
Gérard Cornuéjols, Yanjun Li
openaire   +2 more sources

On the complexity of integer programming

Journal of the ACM, 1981
A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints.
openaire   +2 more sources

Integer Programming Models

Linear and Convex Optimization, 2021

semanticscholar   +1 more source

Integer and Mixed-Integer Programming

1997
We survey techniques for sensitivity analysis of integer programming and related problems. The emphasis is on finding analogues from linear programming.
openaire   +2 more sources

Logic applied to integer programming and integer programming applied to logic

European Journal of Operational Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

An all integer method for integer convex programs

Mathematische Operationsforschung und Statistik. Series Optimization, 1980
A finite all integer method is proposed for solving a class of integer convex programming problems in which the problem functions are convex polynomials with rational coefficients. A small numerical example is also given to illustrate the algorithm.
M. Chandramohan, Suresh Chandra
openaire   +3 more sources