Results 61 to 70 of about 84,498 (293)
, 2011 We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm ...
Bayati M. +11 more
core +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Fractional CCP: A Fuzzy Goal Programming Approach
International Journal of Industrial Engineering and Production Research, 2014 It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional ...
Yahia Zare Mehrjerdi
doaj
A Novel Approach for Solving Quadratic Fractional Programming Problems
Croatian Operational Research Review, 2018 In this paper, quadratic fractional programming (QFP) problems involving a factorized or non-factorized objective function and subject to homogenous or non-homogenous constraints are considered.
Mustafa Sivri +2 more
doaj +1 more source
An exact method for a discrete multiobjective linear fractional optimization [PDF]
Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core +1 more source
The metric dimension and metric independence of a graph [PDF]
, 2001 A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core
FEBS Letters, EarlyView.Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Energy Efficient Coordinated Beamforming for Multi-cell MISO Systems
, 2013 In this paper, we investigate the optimal energy efficient coordinated beamforming in multi-cell multiple-input single-output (MISO) systems with $K$ multiple-antenna base stations (BS) and $K$ single-antenna mobile stations (MS), where each BS sends ...
Huang, Yi, Qiu, Ling, Xu, Jie
core +1 more source
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
Molecular Oncology, EarlyView.The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla +10 more
wiley +1 more source
FINANCIAL STRUCTURE OPTIMIZATION BY USING A GOAL PROGRAMMING APPROACH
Croatian Operational Research Review, 2012 This paper proposes a new methodology for solving the multiple objective fractional linear programming problems using Taylor’s formula and goal programming techniques.
Tunjo Perić, Zoran Babić
doaj