Results 71 to 80 of about 773,474 (304)

PENERAPAN METODE BINOMIAL TREE DALAM MENGESTIMASI HARGA KONTRAK OPSI TIPE AMERIKA

open access: yesE-Jurnal Matematika, 2016
Binomial tree is a method that can be used to determine price option contracts. In this method, the stock price movement is presented in the form of a  tree with each branch representing the probability of the stock price to move up or move down.
I GUSTI AYU MITA ERMIA SARI   +2 more
doaj   +1 more source

Heuristic branch-and-price for building long term trainee schedules. [PDF]

open access: yes
Branch-and-price is an increasingly important technique for solving large integer programming models. Staff scheduling has been a particularly fruitful area since these problems typically exhibit a decomposable structure.
Belien, Jeroen, Demeulemeester, Erik
core  

Molecular dynamics simulations of positively selected codons in FcγRI reveal novel biochemical binding properties

open access: yesFEBS Open Bio, EarlyView.
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young   +7 more
wiley   +1 more source

On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. [PDF]

open access: yes
In this paper a comparison is made between two decomposition techniques to solve a staff scheduling problem with column generation. In the first approach, decomposition takes place on the staff members, whereas in the second approach decomposition takes ...
Belien, Jeroen, Demeulemeester, Erik
core  

A Branch-And-Price Approach for Graph Multi-Coloring [PDF]

open access: yes, 2007
We present a branch-and-price framework for solving the graph multicoloring problem. We propose column generation to implicitly optimize the linear programming relaxation of an independent set formulation (where there is one variable for each independent set in the graph) for graph multi-coloring.
Anuj Mehrotra, Trick, Michael
openaire   +1 more source

Cyclic azapeptide CD36 ligand attenuates cardiac injury and reduces long‐chain fatty acid accumulation after myocardial ischemia–reperfusion in mice

open access: yesFEBS Open Bio, EarlyView.
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin   +12 more
wiley   +1 more source

Models for the optimization of promotion campaigns: exact and heuristic algorithms. [PDF]

open access: yes
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign.
Leus, Roel   +2 more
core  

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation

open access: yesIEEE Access, 2019
Train crew management is an imperative task in a passenger railway system and is typically decomposed into two sub-problems: crew scheduling problem and crew rostering problem.
Dung-Ying Lin, Meng-Rung Tsai
doaj   +1 more source

Reformulation and decomposition of integer programs [PDF]

open access: yes
In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based ...
VANDERBECK  , François   +1 more
core  

Home - About - Disclaimer - Privacy