On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs

On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs

Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a comp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2018-05, Vol.54 (3), p.385-390
Hauptverfasser: Perepelitsa, V. A., Tereschenko, E. V.
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Control
Criteria
Economic models
Mathematics
Mathematics and Statistics
Optimization
Processor Architectures
Software Engineering/Programming and Operating Systems
Systems Theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 390
container_issue 3
container_start_page 385
container_title Cybernetics and systems analysis
container_volume 54
creator Perepelitsa, V. A.
Tereschenko, E. V.
description Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.
doi_str_mv 10.1007/s10559-018-0040-1
format Article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2043510411</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A544511568</galeid><sourcerecordid>A544511568</sourcerecordid><originalsourceid>FETCH-LOGICAL-c341t-c3fe35010efe2f6978a71736659eeb7805f39bf4850e15d863b0afa8ebbbc65b3</originalsourceid><addsrcrecordid>eNp1kVtL9DAQhot8gscf4F3BKy-iM5umTS9l8YTCerwOaXeyRrZNTbJ4-PVmqShefAzMDMPzzgy8WXaAcIwA1UlAEKJmgJIBFMBwI9tGUXEmOa_-pR5KYMDrcivbCeEFADhUcju7nvX51HXDkiLlup_ndysdLPsZPb45NvU2krc6nw3RdvZTR-v6_Na7ZkldyFN_4fXwHPayTaOXgfa_6272dH72OL1kN7OLq-npDWt5gTFlQ1wAAhmamLKupK6w4mUpaqKmkiAMrxtTSAGEYi5L3oA2WlLTNG0pGr6bHY57B-9eVxSienEr36eTagIFFwgFYqKOR2qhl6Rsb1z0uk0xp862ridj0_xUFIVAFKVMgqM_gsREeo8LvQpBXT3c_2VxZFvvQvBk1OBtp_2HQlBrQ9RoiEqGqLUhav3QZNSExPYL8r9v_1_0BVnoi80</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2043510411</pqid></control><display><type>article</type><title>On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs</title><source>SpringerLink Journals - AutoHoldings</source><creator>Perepelitsa, V. A. ; Tereschenko, E. V.</creator><creatorcontrib>Perepelitsa, V. A. ; Tereschenko, E. V.</creatorcontrib><description>Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.</description><identifier>ISSN: 1060-0396</identifier><identifier>EISSN: 1573-8337</identifier><identifier>DOI: 10.1007/s10559-018-0040-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Artificial Intelligence ; Control ; Criteria ; Economic models ; Mathematics ; Mathematics and Statistics ; Optimization ; Processor Architectures ; Software Engineering/Programming and Operating Systems ; Systems Theory</subject><ispartof>Cybernetics and systems analysis, 2018-05, Vol.54 (3), p.385-390</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>COPYRIGHT 2018 Springer</rights><rights>Cybernetics and Systems Analysis is a copyright of Springer, (2018). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c341t-c3fe35010efe2f6978a71736659eeb7805f39bf4850e15d863b0afa8ebbbc65b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10559-018-0040-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10559-018-0040-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Perepelitsa, V. A.</creatorcontrib><creatorcontrib>Tereschenko, E. V.</creatorcontrib><title>On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs</title><title>Cybernetics and systems analysis</title><addtitle>Cybern Syst Anal</addtitle><description>Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.</description><subject>Artificial Intelligence</subject><subject>Control</subject><subject>Criteria</subject><subject>Economic models</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Optimization</subject><subject>Processor Architectures</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Systems Theory</subject><issn>1060-0396</issn><issn>1573-8337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kVtL9DAQhot8gscf4F3BKy-iM5umTS9l8YTCerwOaXeyRrZNTbJ4-PVmqShefAzMDMPzzgy8WXaAcIwA1UlAEKJmgJIBFMBwI9tGUXEmOa_-pR5KYMDrcivbCeEFADhUcju7nvX51HXDkiLlup_ndysdLPsZPb45NvU2krc6nw3RdvZTR-v6_Na7ZkldyFN_4fXwHPayTaOXgfa_6272dH72OL1kN7OLq-npDWt5gTFlQ1wAAhmamLKupK6w4mUpaqKmkiAMrxtTSAGEYi5L3oA2WlLTNG0pGr6bHY57B-9eVxSienEr36eTagIFFwgFYqKOR2qhl6Rsb1z0uk0xp862ridj0_xUFIVAFKVMgqM_gsREeo8LvQpBXT3c_2VxZFvvQvBk1OBtp_2HQlBrQ9RoiEqGqLUhav3QZNSExPYL8r9v_1_0BVnoi80</recordid><startdate>20180501</startdate><enddate>20180501</enddate><creator>Perepelitsa, V. A.</creator><creator>Tereschenko, E. V.</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>S0W</scope></search><sort><creationdate>20180501</creationdate><title>On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs</title><author>Perepelitsa, V. A. ; Tereschenko, E. V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c341t-c3fe35010efe2f6978a71736659eeb7805f39bf4850e15d863b0afa8ebbbc65b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Artificial Intelligence</topic><topic>Control</topic><topic>Criteria</topic><topic>Economic models</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Optimization</topic><topic>Processor Architectures</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Systems Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Perepelitsa, V. A.</creatorcontrib><creatorcontrib>Tereschenko, E. V.</creatorcontrib><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering &amp; Technology Collection</collection><jtitle>Cybernetics and systems analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Perepelitsa, V. A.</au><au>Tereschenko, E. V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs</atitle><jtitle>Cybernetics and systems analysis</jtitle><stitle>Cybern Syst Anal</stitle><date>2018-05-01</date><risdate>2018</risdate><volume>54</volume><issue>3</issue><spage>385</spage><epage>390</epage><pages>385-390</pages><issn>1060-0396</issn><eissn>1573-8337</eissn><abstract>Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10559-018-0040-1</doi><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1060-0396
ispartof Cybernetics and systems analysis, 2018-05, Vol.54 (3), p.385-390
issn 1060-0396
1573-8337
language eng
recordid cdi_proquest_journals_2043510411
source SpringerLink Journals - AutoHoldings
subjects Artificial Intelligence
Control
Criteria
Economic models
Mathematics
Mathematics and Statistics
Optimization
Processor Architectures
Software Engineering/Programming and Operating Systems
Systems Theory
title On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T20%3A46%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Complete%20and%20Quasi-Complete%20Two-Criteria%20Optimization%20Problems%20on%20Graphs&rft.jtitle=Cybernetics%20and%20systems%20analysis&rft.au=Perepelitsa,%20V.%20A.&rft.date=2018-05-01&rft.volume=54&rft.issue=3&rft.spage=385&rft.epage=390&rft.pages=385-390&rft.issn=1060-0396&rft.eissn=1573-8337&rft_id=info:doi/10.1007/s10559-018-0040-1&rft_dat=%3Cgale_proqu%3EA544511568%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2043510411&rft_id=info:pmid/&rft_galeid=A544511568&rfr_iscdi=true