Results 281 to 290 of about 134,104 (337)

Anesthesia Practice Shift Scheduling With a Generative Deep Learning Model. [PDF]

Cureus
Emeneker W, Heape S, Hartman G, Gillespie M, Perkins S.   +4 more
europepmc   +1 more source

Optimizing nutritionally adequate food basket using linear programming in Niayes Households, Senegal. [PDF]

PLoS One
Willane CT, Sylla PMDD, Thiam M, Ndiaye BM, Tall L, Idohou-Dossou N, Diouf A.   +6 more
europepmc   +1 more source

Data-Driven Chance-Constrained Mixed Integer Nonlinear Bi-level Optimisation Via Copulas: Application To Integrated Planning And Scheduling Problems. [PDF]

Syst Control Trans
Johnn SN, Nikkhah H, Tsai ML, Avraamidou S, Beykal B, Charitopoulos VM.   +5 more
europepmc   +1 more source

Optimizing District Heating Systems Using Mixed-Integer Linear Programming with PuLP [PDF]

Imam, Hafiz Muhammad Ahmad
openalex  

A branch and bound algorithm for integer and mixed-integer linear programs.

, 1969
Joseph Bannan Missal
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Testing copositivity via mixed–integer linear programming

Linear Algebra and its Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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

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

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.
Benichou, M., Gauthier, J. M., Girodet, P., Hentges, G., Ribière, G., Vincent, O.   +5 more
openaire   +2 more sources