Results 211 to 220 of about 9,060 (260)

A multi-period robust portfolio optimization framework using yager's entropy. [PDF]

PLoS One
Khosravi A, Sadjadi SJ.
europepmc   +1 more source

Using Quadratic Programming to Reconstruct Data From Published Survival and Competing Risks Analyses. [PDF]

Stat Med
Titman AC.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Experiments in mixed-integer linear programming

Mathematical Programming, 1971
This paper presents a “branch and bound” method for solving mixed integer linear programming problems. After briefly discussing the bases of the method, new concepts called pseudo-costs and estimations are introduced. Then, the heuristic rules for generating the tree, which are the main features of the method, are presented.
Michel Bénichou, Jean-Michel Gauthier, Paul Girodet, Gerard Hentges, Gerard Ribière, O. Vincent   +5 more
openaire   +2 more sources

Nonlinear and Mixed Integer Linear Programming

2012
In this chapter we compare continuous nonlinear optimization with mixed integer optimization of water supply networks by means of a meso scaled network instance. We introduce a heuristic approach, which handles discrete decisions arising in water supply network optimization through penalization using nonlinear programming.
Kolb, Oliver, Morsi, Antonio, Lang, Jens, Martin, Alexander   +3 more
openaire   +2 more sources

Mixed-Integer Linear Programming Formulations

2014
In this chapter, (mixed-)integer linear programming formulations of the resource-constrained project scheduling problem are presented. Standard formulations from the literature and newly proposed formulations are classified according to their size in function of the input data.
Artigues, Christian, Kone, Oumar, Lopez, Pierre, Mongeau, Marcel   +3 more
openaire   +2 more sources

Safe bounds in linear and mixed-integer linear programming

Mathematical Programming, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold Neumaier, Oleg Shcherbina
openaire   +3 more sources

The Mixed Integer Linear Bilevel Programming Problem

Operations Research, 1990
A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel optimization problem. In this paper, we examine the case where each player tries to maximize the individual objective function over a jointly constrained polyhedron. The decision variables are variously partitioned into continuous and discrete sets. The
James T. Moore, Jonathan F. Bard
openaire   +1 more source

An optimality cut for mixed integer linear programs

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilbert Laporte, Frédéric Semet
openaire   +1 more source

A DC Programming Approach for Mixed-Integer Linear Programs

2008
In this paper, we propose a new efficient algorithm for globally solving a class of Mixed Integer Program (MIP). If the objective function is linear with both continuous variables and integer variables, then the problem is called a Mixed Integer Linear Program (MILP). Researches on MILP are important in both theoretical and practical aspects.
Yi-Shuai Niu, Pham Dinh Tao
openaire   +1 more source

Bivium as a Mixed-Integer Linear Programming Problem

2009
Trivium is a stream cipher proposed for the eSTREAM project. Raddum introduced some reduced versions of Trivium, named Bivium A and Bivium B. In this article we present a numerical attack on the Biviums. The main idea is to transform the problem of solving a sparse system of quadratic equations over GF (2) into a combinatorial optimization problem.
Julia Borghoff, Lars R. Knudsen, Mathias Stolpe   +2 more
openaire   +1 more source