Possibility Optimal Risk Management in Magistral Gas and Oil Transportation Systems

Authors: Agammedova, S. A.^Aff15, Habibov, I. A.^Aff15

Contributors: Kacprzyk, Janusz, Series Editor^{Aff1, Aff10}, Gomide, Fernando, Advisory Editor^Aff2, Kaynak, Okyay, Advisory Editor^Aff3, Liu, Derong, Advisory Editor^Aff4, Pedrycz, Witold, Advisory Editor^{Aff5, Aff11}, Polycarpou, Marios M., Advisory Editor^Aff6, Rudas, Imre J., Advisory Editor^Aff7, Wang, Jun, Advisory Editor^Aff8, Aliev, Rafik A., editor^Aff9, Jamshidi, Mo, editor^Aff12, Babanli, Mustafa, editor^Aff13, Sadikoglu, Fahreddin M., editor^Aff14

Source: 11th International Conference on Theory and Application of Soft Computing, Computing with Words and Perceptions and Artificial Intelligence - ICSCCW-2021. 362:567-574

Direct multiplicative methods for sparse matrices. Newton methods

Authors: Anastasiya Borisovna Sviridenko

Source: Компьютерные исследования и моделирование, Vol 9, Iss 5, Pp 679-703 (2017)

Subject Terms: the direction of descent, T57-57.97, Applied mathematics. Quantitative methods, sparse matrices, 0211 other engineering and technologies, linear programming, 02 engineering and technology, Newton methods, 01 natural sciences, necessary and sufficient conditions of optimality, $NP$-hard problem, pseudo Boolean programming, QA1-939, a new mathematical formulation, minimization pseudo Boolean functions, 0101 mathematics, direct multiplication algorithm, Mathematics

Access URL: http://crm.ics.org.ru/uploads/crmissues/crm_2017_5/2017_05_09_01.pdf
https://doaj.org/article/bfffa7396dc7415ca3057ad2531cdcc3

The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases

Authors: Punnen, Abraham P. ^{a, ⁎}, Sripratak, Piyashat ^b, Karapetyan, Daniel ^c

Source: In Discrete Applied Mathematics 1 October 2015 193:1-10

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes

Authors: Angibaud, Sébastien^Aff1, Fertin, Guillaume^Aff1, Rusu, Irena^Aff1, Thévenin, Annelyse^Aff2, Vialette, Stéphane^Aff2

Contributors: Istrail, Sorin, editor, Pevzner, Pavel, editor, Waterman, Michael S., editor, Tesler, Glenn, editor, Durand, Dannie, editor

Source: Comparative Genomics : RECOMB 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007. Proceedings. 4751:16-29

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation

Authors: Angibaud, Sébastien^Aff21, Fertin, Guillaume^Aff21, Rusu, Irena^Aff21, Vialette, Stéphane^Aff22

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Dough, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Istrail, Sorin, editor^Aff16, Pevzner, Pavel, editor^Aff17, Waterman, Michael, editor^Aff18, Bourque, Guillaume, editor^Aff19, El-Mabrouk, Nadia, editor^Aff20

Source: Comparative Genomics : RECOMB 2006 International Workshop, RCG 2006 Montreal, Canada, September 24-26, 2006 Proceedings. 4205:75-86

Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming

Authors: Papaioannou, S.G.

Source: IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. C-26(6):553-560 Jun, 1977

Hyperneural network-an efficient model for test generation in digital circuits: Hyperneural network -- an efficient model for test generation in digital circuits.

Authors: Weian Deng, Suresh Rai

Source: IEEE Transactions on Computers. 45:115-121

Subject Terms: logic circuit testing, satisfiability problem, Learning and adaptive systems in artificial intelligence, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Fault detection, testing in circuits and networks, pseudo-Boolean programming

File Description: application/xml

Access URL: https://zbmath.org/1966841
https://doi.org/10.1109/12.481493
https://ieeexplore.ieee.org/document/481493/
https://dblp.uni-trier.de/db/journals/tc/tc45.html#RaiD96

Upper-bounds for quadratic 0–1 maximization

Authors: Boros, Endre, Crama, Yves, Hammer, Peter L.

Source: Operations Research Letters. 9:73-79

Subject Terms: Business & economic sciences, Physique, chimie, mathématiques & sciences de la terre, 0211 other engineering and technologies, linearization, Quantitative methods in economics & management, 0102 computer and information sciences, 02 engineering and technology, pseudo-Boolean programming, 01 natural sciences, Méthodes quantitatives en économie & gestion, quadratic 0–1 maximization, Mathématiques, Physical, chemical, mathematical & earth Sciences, Sciences économiques & de gestion, Mathematics

Access URL: https://orbi.uliege.be/bitstream/2268/217426/1/Upper%20bounds%20Quadratic%20ORLetters%20%20preprint.pdf
https://core.ac.uk/display/143645917
http://orbi.ulg.ac.be/handle/2268/217426
https://www.sciencedirect.com/science/article/pii/0167637790900446
https://orbi.uliege.be/handle/2268/217426
http://www.sciencedirect.com/science/article/pii/0167637790900446

A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

Authors: Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane

Contributors: Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École nationale des ponts et chaussées (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)

Source: ISSN: 1066-5277.

Subject Terms: duplication, common inter- vals, genome rearrangement, pseudo-boolean programming, heuristic, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Availability: https://hal.science/hal-00417735
https://hal.science/hal-00417735v1/document
https://hal.science/hal-00417735v1/file/PSBJCB.pdf
https://doi.org/10.1089/cmb.2007.A001

Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders ; Aspects algorithmiques des réarrangements génomiques : duplications et ordres partiels

Authors: Thévenin, Annelyse

Contributors: Bioinformatique (LRI) (BioInfo - LRI), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Université Paris Sud - Paris XI, Alain Denise et Stéphane Vialette(Alain.Denise@lri.fr et vialette@univ-mlv.fr)

Source: https://theses.hal.science/tel-00768996 ; Bio-informatique [q-bio.QM]. Université Paris Sud - Paris XI, 2009. Français. ⟨NNT : 2009PA112194⟩.

Subject Terms: Comparative genomics, (dis)similarity measures, duplicated gene, exemplar/intermediate/maximum matching, polynomial time approximation, partially ordered genome, pseudo-boolean programming, heuristic, heuristique, Génomique comparative, mesures de (dis)similarités, gènes dupliqués, couplage exemplaire/intermédiaire/maximum, approximation en temps polynomial, génome partiellement ordonné, programme pseudo-booléen, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM]

Relation: NNT: 2009PA112194

Availability: https://theses.hal.science/tel-00768996
https://theses.hal.science/tel-00768996v1/document
https://theses.hal.science/tel-00768996v1/file/PhD-Thevenin.pdf

A general framework for computing rearrangement distances between genomes with duplicates

Authors: Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.sciences.univ-nantes.fr/info/perso/permanents/fertin/PAPERS/PSBJCB.pdf.

Subject Terms: pseudo-boolean programming, genome rearrangement, common inter- vals

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.2246

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.2246
http://www.sciences.univ-nantes.fr/info/perso/permanents/fertin/PAPERS/PSBJCB.pdf

A general framework for computing rearrangement distances between genomes with duplicates

Authors: Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://hal.archives-ouvertes.fr/docs/00/41/77/35/PDF/PSBJCB.pdf.

Subject Terms: pseudo-boolean programming, genome rearrangement, common intervals, duplication, heuristic

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.1876

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.1876
http://hal.archives-ouvertes.fr/docs/00/41/77/35/PDF/PSBJCB.pdf

Algorithms for nonlinear pseudo-Boolean programming

Authors: Zak, Yu. A.

Subject Terms: nonlinear pseudo-Boolean programming, Numerical mathematical programming methods, directed sorting, Nonlinear programming, branch-and-bound method, Boolean programming, algorithms, computational experience

File Description: application/xml

Access URL: https://zbmath.org/3706248

On the state minimization of incompletely specified sequential machines

Authors: Bucurescu, Irina

Subject Terms: incompletely specified sequential machines, Formal languages and automata, state minimization, pseudo- Boolean programming

File Description: application/xml

Access URL: https://zbmath.org/3675321

Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders

Authors: Thévenin, Annelyse

Contributors: Thévenin, Annelyse

Subject Terms: Génomique comparative, [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Comparative genomics, exemplar/intermediate/maximum matching, couplage exemplaire/intermédiaire/maximum, duplicated gene, programme pseudo-booléen, partially ordered genome, polynomial time approximation, approximation en temps polynomial, génome partiellement ordonné, heuristic, heuristique, mesures de (dis)similarités, gènes dupliqués, (dis)similarity measures, pseudo-boolean programming, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

File Description: application/pdf

Access URL: https://theses.hal.science/tel-00768996v1

On Some Probabilistic Decoding Algorithms

Authors: Haddad, A.H.

Subject Terms: Probabilistic decoding, Integer programming, Pseudo-Boolean programming

Relation: Coordinated Science Laboratory Report no. UILU-ENG 70-241, R-496; http://hdl.handle.net/2142/74737

Availability: http://hdl.handle.net/2142/74737