Results 261 to 270 of about 44,777 (299)

Near‐Infrared Polarimetric Imaging With Nonlinear Flat‐Optics

Laser &Photonics Reviews, EarlyView.
ABSTRACT A compact and broadband polarimetric imaging platform is presented, based on second‐harmonic generation (SHG) in nonlinear flat‐optics. The system employs periodic all‐dielectric AlGaAs gratings to induce polarization‐dependent SH emission, enabling pixel by pixel direct retrieval of the full Stokes vector from an input intensity distribution ...
Evgenii Menshikov, Marco A. López Sánchez, Paolo Franceschini, Andrea Tognazzi, Domenico de Ceglia, Kristina Frizyuk, Costantino De Angelis   +6 more
wiley   +1 more source

An open-source optimization model for sustainable open-pit mine production scheduling. [PDF]

Front Artif Intell
Lotsu JS, Bimpong GY, Boakye K.
europepmc   +1 more source

Optimal radiotherapy dose scheduling with variable fraction sizes and breaks via sequential mixed-integer convex programming. [PDF]

Phys Imaging Radiat Oncol
Fu A, Gouw Z, Jeong J, Deasy JO.
europepmc   +1 more source

Research on optimization of train routing problem for railway hubs considering passenger demand. [PDF]

PLoS One
Wang Y.
europepmc   +1 more source

Research on a fuzzy programming model and algorithm for berth allocation considering time-varying water depth. [PDF]

Sci Rep
Liu D, Li B, Li M, Lei Y, Yu P, Tan C.
europepmc   +1 more source

Solving the Battleship puzzle as an integer programming problem.

Meuffels, W.J.M., Hertog, D. den
core  

Some of the next articles are maybe not open access.

Related searches:

An integer linear programming approach for bilinear integer programming

Operations Research Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Moreno, Juan Pablo Vielma
exaly   +3 more sources

On the foundations of linear and integer linear programming I

Mathematical Programming, 1975
In this paper we consider the question: how does the flow algorithm and the simplex algorithm work? The usual answer has two parts: first a description of the "improvement process", and second a proof that if no further improvement can be made by this process, an optimal vector has been found.
openaire   +2 more sources

Integer Linear Programming in Computational Biology

2009
Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to ...
Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert   +4 more
openaire   +2 more sources