The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm
We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l ∞ norm. Given an edge weighted connected undirected network G = ( V , E , w ) , a spanning tree T 0 , a lower bound vector l and a value K , we aim to find a new weight vector w ¯ respecting the lower b...
Gespeichert in:
| Veröffentlicht in: | Journal of global optimization Jg. 79; H. 3; S. 757 - 777 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Springer US
01.03.2021
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 0925-5001, 1573-2916 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit
l
∞
norm. Given an edge weighted connected undirected network
G
=
(
V
,
E
,
w
)
, a spanning tree
T
0
, a lower bound vector
l
and a value
K
, we aim to find a new weight vector
w
¯
respecting the lower bound such that
T
0
is a minimum spanning tree under the vector
w
¯
with weight
K
, and the objective is to minimize the modification cost under unit
l
∞
norm. We present a mathematical model of the problem. After analyzing optimality conditions of the problem, we develop a strongly polynomial time algorithm with running time
O
(|
V
||
E
|). Finally, we give an example to demonstrate the algorithm and present the numerical experiments. |
|---|---|
| AbstractList | We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit
l
∞
norm. Given an edge weighted connected undirected network
G
=
(
V
,
E
,
w
)
, a spanning tree
T
0
, a lower bound vector
l
and a value
K
, we aim to find a new weight vector
w
¯
respecting the lower bound such that
T
0
is a minimum spanning tree under the vector
w
¯
with weight
K
, and the objective is to minimize the modification cost under unit
l
∞
norm. We present a mathematical model of the problem. After analyzing optimality conditions of the problem, we develop a strongly polynomial time algorithm with running time
O
(|
V
||
E
|). Finally, we give an example to demonstrate the algorithm and present the numerical experiments. We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm. Given an edge weighted connected undirected network G=(V,E,w), a spanning tree T0, a lower bound vector l and a value K, we aim to find a new weight vector w¯ respecting the lower bound such that T0 is a minimum spanning tree under the vector w¯ with weight K, and the objective is to minimize the modification cost under unit l∞ norm. We present a mathematical model of the problem. After analyzing optimality conditions of the problem, we develop a strongly polynomial time algorithm with running time O(|V||E|). Finally, we give an example to demonstrate the algorithm and present the numerical experiments. |
| Author | Liu, Yan Wang, Hui Zhang, Binwu Guan, Xiucui Pardalos, Panos M. Zhang, Qiao Chen, Shuyi |
| Author_xml | – sequence: 1 givenname: Binwu surname: Zhang fullname: Zhang, Binwu organization: College of Science, Hohai University, Institute of Intelligent Optimization and Control, Hohai University – sequence: 2 givenname: Xiucui orcidid: 0000-0002-2653-1868 surname: Guan fullname: Guan, Xiucui email: xcguan@163.com organization: School of Mathematics, Southeast University – sequence: 3 givenname: Panos M. surname: Pardalos fullname: Pardalos, Panos M. organization: Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, LATNA, Higher School of Economics – sequence: 4 givenname: Hui surname: Wang fullname: Wang, Hui organization: School of Mathematics, Southeast University – sequence: 5 givenname: Qiao surname: Zhang fullname: Zhang, Qiao organization: School of Mathematics, Southeast University – sequence: 6 givenname: Yan surname: Liu fullname: Liu, Yan organization: College of Science, Hohai University, Institute of Intelligent Optimization and Control, Hohai University – sequence: 7 givenname: Shuyi surname: Chen fullname: Chen, Shuyi organization: School of Business Administration, Hohai University |
| BookMark | eNp9kEtOwzAQhi1UJNrCBVhZYh0Y20kTL1HFS6rEpiyR5SST4iqxi50UcQNOweE4CS5FQmLRzczm_-bxTcjIOouEnDO4ZAD5VWBQyCIBDgmATPNEHJExy3KRcMlmIzIGybMkA2AnZBLCGmKqyPiYPC9fkLbuDT0t3WBrrKmxW_QBqdv0ptMt3ep2QLrxrmyxo87SzljTDR0NG22tsSvae0S6g32spqft18cntc53p-S40W3As98-JU-3N8v5fbJ4vHuYXy-SSjDZJ6KpseSgGYeizKXkWKQZYxlLgVfASqhnAmY1w0KWjajTtNYNMF1mVcPTjDMxJRf7ufHK1wFDr9Zu8DauVDyNOkDmPI0pvk9V3oXgsVEbHz_074qB2mlUe40qalQ_GpWIUPEPqkyve-Ns77VpD6Nij4a4x67Q_111gPoGsLSKFw |
| CitedBy_id | crossref_primary_10_1007_s10878_021_00721_5 crossref_primary_10_1007_s10898_022_01256_7 crossref_primary_10_1016_j_apnum_2024_02_004 crossref_primary_10_1016_j_cam_2024_116110 |
| Cites_doi | 10.1006/jagm.1999.1052 10.1007/s11590-017-1165-2 10.1007/s10898-005-6470-0 10.1007/s10898-008-9294-x 10.1016/j.tcs.2016.06.002 10.1287/mnsc.2017.2841 10.1007/s11590-020-01553-8 10.1007/s10878-005-5486-1 10.1080/10556789708805666 10.1016/j.ejor.2007.04.031 10.1287/opre.51.5.785.16756 10.1287/opre.47.2.291 10.1007/s10898-017-0546-5 10.1007/s10107-004-0515-x 10.1007/BF01194328 10.1016/j.cam.2007.08.005 10.1007/s10898-017-0554-5 10.1016/j.tcs.2007.12.006 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2O M2P M7S MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s10898-020-00947-3 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global (OCUL) Computing Database Research Library Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central (ProQuest) url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Sciences (General) Computer Science |
| EISSN | 1573-2916 |
| EndPage | 777 |
| ExternalDocumentID | 10_1007_s10898_020_00947_3 |
| GrantInformation_xml | – fundername: Chinese Universities Scientific Fund grantid: 2018B44014 funderid: http://dx.doi.org/10.13039/501100005236 – fundername: National Natural Science Foundation of China grantid: 11471073; 11901153 funderid: http://dx.doi.org/10.13039/501100001809 – fundername: National Research University Higher School of Economics (RU) grantid: HSE – fundername: Natural Science Foundation of Jiangsu Province grantid: 20170298 funderid: http://dx.doi.org/10.13039/501100004608 |
| GroupedDBID | -52 -57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29K 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2O M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCLPG SDD SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8T Z8U Z8W Z92 ZMTXR ZWQNP ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c319t-3fdeb20a1208b7992e8451151402c01b0d6306d1e89bf3d44daf01ab5cf245213 |
| IEDL.DBID | M2P |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000568481700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-5001 |
| IngestDate | Tue Nov 04 23:19:32 EST 2025 Sat Nov 29 01:59:35 EST 2025 Tue Nov 18 22:26:37 EST 2025 Fri Feb 21 02:49:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Inverse optimal value problem Strongly polynomial time algorithm Minimum spanning tree norm |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c319t-3fdeb20a1208b7992e8451151402c01b0d6306d1e89bf3d44daf01ab5cf245213 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2653-1868 |
| PQID | 2494709724 |
| PQPubID | 29930 |
| PageCount | 21 |
| ParticipantIDs | proquest_journals_2494709724 crossref_primary_10_1007_s10898_020_00947_3 crossref_citationtrail_10_1007_s10898_020_00947_3 springer_journals_10_1007_s10898_020_00947_3 |
| PublicationCentury | 2000 |
| PublicationDate | 20210300 2021-03-00 20210301 |
| PublicationDateYYYYMMDD | 2021-03-01 |
| PublicationDate_xml | – month: 3 year: 2021 text: 20210300 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationSubtitle | An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering |
| PublicationTitle | Journal of global optimization |
| PublicationTitleAbbrev | J Glob Optim |
| PublicationYear | 2021 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Liu, Wang (CR12) 2009; 43 Guan, He, Pardalos, Zhang (CR6) 2017; 69 Ahuja, Orlin (CR3) 2000; 34 Li, Zhang, Du (CR15) 2018; 70 Li, Zhang, Lai (CR14) 2016; 640 Ahmed, Guan (CR1) 2005; 102 Ahuja, Magnanti, Orlin (CR2) 1993 Liu, Yao (CR13) 2008; 396 Sokkalingam, Ahuja, Orlin (CR16) 1999; 47 Zhang, Zhang, He (CR20) 2006; 34 He, Zhang, Yao (CR9) 2005; 9 Cai, Duin, Yang, Zhang (CR4) 2008; 188 Guan, Pardalos, Zhang (CR7) 2018; 12 CR11 Zhang, Guan, Zhang (CR17) 2020 Zhang, Liu, Ma (CR18) 1996; 44 Lv, Hua, Wan (CR10) 2008; 220 Zhang, Xu, Ma (CR19) 1997; 8 Chan, Lee, Terekhov (CR5) 2019; 65 Hochbaum (CR8) 2003; 51 RK Ahuja (947_CR2) 1993 XC Guan (947_CR6) 2017; 69 YB Lv (947_CR10) 2008; 220 947_CR11 JZ Zhang (947_CR19) 1997; 8 TCY Chan (947_CR5) 2019; 65 RK Ahuja (947_CR3) 2000; 34 MC Cai (947_CR4) 2008; 188 XC Guan (947_CR7) 2018; 12 LC Liu (947_CR12) 2009; 43 XY Li (947_CR15) 2018; 70 S Ahmed (947_CR1) 2005; 102 BW Zhang (947_CR17) 2020 BW Zhang (947_CR20) 2006; 34 JZ Zhang (947_CR18) 1996; 44 PT Sokkalingam (947_CR16) 1999; 47 DS Hochbaum (947_CR8) 2003; 51 Y He (947_CR9) 2005; 9 LC Liu (947_CR13) 2008; 396 S Li (947_CR14) 2016; 640 |
| References_xml | – year: 1993 ident: CR2 publication-title: Network Flows, Theory, Algorithms, and Applications – volume: 34 start-page: 177 year: 2000 end-page: 193 ident: CR3 article-title: A faster algorithm for the inverse spanning tree problem publication-title: J. Algorithm doi: 10.1006/jagm.1999.1052 – volume: 12 start-page: 1065 issue: 5 year: 2018 end-page: 1077 ident: CR7 article-title: Inverse max+sum spanning tree problem under weighted norm by modifying the sum-cost vector publication-title: Optim. Lett. doi: 10.1007/s11590-017-1165-2 – volume: 34 start-page: 467 year: 2006 end-page: 474 ident: CR20 article-title: Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance publication-title: J. Glob. Optim. doi: 10.1007/s10898-005-6470-0 – volume: 43 start-page: 83 year: 2009 end-page: 95 ident: CR12 article-title: Constrained inverse min-max spanning tree problems under the weighted Hamming distance publication-title: J. Glob. Optim. doi: 10.1007/s10898-008-9294-x – volume: 640 start-page: 119 year: 2016 end-page: 124 ident: CR14 article-title: Algorithms for constraint partial inverse matroid problem with weight increase forbidden publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.06.002 – ident: CR11 – volume: 65 start-page: 955 year: 2019 end-page: 1453 ident: CR5 article-title: Inverse optimization: closed-form solutions, geometry, and goodness of fit publication-title: Manag. Sci. doi: 10.1287/mnsc.2017.2841 – year: 2020 ident: CR17 article-title: Inverse optimal value problem on minimum spanning tree under unit norm publication-title: Optim. Lett. doi: 10.1007/s11590-020-01553-8 – volume: 9 start-page: 91 issue: 1 year: 2005 end-page: 100 ident: CR9 article-title: Weighted inverse minimum spanning tree problems under Hamming distance publication-title: J. Comb. Optim. doi: 10.1007/s10878-005-5486-1 – volume: 8 start-page: 69 year: 1997 end-page: 84 ident: CR19 article-title: An algorithm for inverse minimum spanning tree problem publication-title: Optim. Method. Softw. doi: 10.1080/10556789708805666 – volume: 188 start-page: 348 year: 2008 end-page: 353 ident: CR4 article-title: The partial inverse minimum spanning tree problem when weight increasing is forbidden publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.04.031 – volume: 51 start-page: 785 year: 2003 end-page: 797 ident: CR8 article-title: Efficient algorithms for the inverse spanning-tree problem publication-title: Oper. Res. doi: 10.1287/opre.51.5.785.16756 – volume: 47 start-page: 291 year: 1999 end-page: 298 ident: CR16 article-title: Solving inverse spanning tree problems through network flow techniques publication-title: Oper. Res. doi: 10.1287/opre.47.2.291 – volume: 69 start-page: 911 issue: 4 year: 2017 end-page: 925 ident: CR6 article-title: Inverse max+sum spanning tree problem under hamming distance by modifying the sum-cost vector publication-title: J. Glob. Optim. doi: 10.1007/s10898-017-0546-5 – volume: 102 start-page: 91 issue: 1 year: 2005 end-page: 110 ident: CR1 article-title: The inverse optimal value problem publication-title: Math. Program. doi: 10.1007/s10107-004-0515-x – volume: 44 start-page: 171 year: 1996 end-page: 188 ident: CR18 article-title: On the inverse problem of minimum spanning tree with partition constraints publication-title: Math. Methods Oper. Res. doi: 10.1007/BF01194328 – volume: 220 start-page: 175 issue: 1–2 year: 2008 end-page: 180 ident: CR10 article-title: A penalty function method for solving inverse optimal value problem publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2007.08.005 – volume: 70 start-page: 677 issue: 3 year: 2018 end-page: 685 ident: CR15 article-title: Partial inverse maximum spanning tree in which weight can only be decreased under -norm publication-title: J. Global. Optim. doi: 10.1007/s10898-017-0554-5 – volume: 396 start-page: 28 year: 2008 end-page: 34 ident: CR13 article-title: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.12.006 – volume: 188 start-page: 348 year: 2008 ident: 947_CR4 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.04.031 – volume: 640 start-page: 119 year: 2016 ident: 947_CR14 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.06.002 – volume: 9 start-page: 91 issue: 1 year: 2005 ident: 947_CR9 publication-title: J. Comb. Optim. doi: 10.1007/s10878-005-5486-1 – volume: 65 start-page: 955 year: 2019 ident: 947_CR5 publication-title: Manag. Sci. doi: 10.1287/mnsc.2017.2841 – volume: 8 start-page: 69 year: 1997 ident: 947_CR19 publication-title: Optim. Method. Softw. doi: 10.1080/10556789708805666 – ident: 947_CR11 – volume: 43 start-page: 83 year: 2009 ident: 947_CR12 publication-title: J. Glob. Optim. doi: 10.1007/s10898-008-9294-x – volume: 70 start-page: 677 issue: 3 year: 2018 ident: 947_CR15 publication-title: J. Global. Optim. doi: 10.1007/s10898-017-0554-5 – volume: 69 start-page: 911 issue: 4 year: 2017 ident: 947_CR6 publication-title: J. Glob. Optim. doi: 10.1007/s10898-017-0546-5 – volume: 34 start-page: 177 year: 2000 ident: 947_CR3 publication-title: J. Algorithm doi: 10.1006/jagm.1999.1052 – volume: 47 start-page: 291 year: 1999 ident: 947_CR16 publication-title: Oper. Res. doi: 10.1287/opre.47.2.291 – year: 2020 ident: 947_CR17 publication-title: Optim. Lett. doi: 10.1007/s11590-020-01553-8 – volume: 220 start-page: 175 issue: 1–2 year: 2008 ident: 947_CR10 publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2007.08.005 – volume: 34 start-page: 467 year: 2006 ident: 947_CR20 publication-title: J. Glob. Optim. doi: 10.1007/s10898-005-6470-0 – volume: 51 start-page: 785 year: 2003 ident: 947_CR8 publication-title: Oper. Res. doi: 10.1287/opre.51.5.785.16756 – volume: 102 start-page: 91 issue: 1 year: 2005 ident: 947_CR1 publication-title: Math. Program. doi: 10.1007/s10107-004-0515-x – volume: 396 start-page: 28 year: 2008 ident: 947_CR13 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.12.006 – volume-title: Network Flows, Theory, Algorithms, and Applications year: 1993 ident: 947_CR2 – volume: 44 start-page: 171 year: 1996 ident: 947_CR18 publication-title: Math. Methods Oper. Res. doi: 10.1007/BF01194328 – volume: 12 start-page: 1065 issue: 5 year: 2018 ident: 947_CR7 publication-title: Optim. Lett. doi: 10.1007/s11590-017-1165-2 |
| SSID | ssj0009852 |
| Score | 2.2965128 |
| Snippet | We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit
l
∞
norm. Given an edge weighted connected undirected network
G... We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm. Given an edge weighted connected undirected network... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 757 |
| SubjectTerms | Algorithms Computer Science Graph theory Lower bounds Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Real Functions Weight |
| SummonAdditionalLinks | – databaseName: Springer Nature Link Journals dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60etCDj6pYrbIHD4oGNo9td48iFi-K-KIXCUl2A4U2lSb1N_gr_HH-EmfSTauigl5Cwr7C7s7uDDPzfQAHWstICSEcI1qpEwQKZU4Y4Qi0b6MgEi0sL8km2ldXsttV1zYpLK-i3SuXZHlSf0h2k5QO5lEmtApQNOZhAa87SYQNN7cPM6hdWfLscOXhkHgK21SZ7_v4fB3NdMwvbtHytums_u8_12DFapfsdLId1mHOZHVYrZgbmBXkOix_gCHEr8spdmteh3VbK2eHFpP6aAMecTuxPjGqsZiImIxmvYwiOgwb4qEzwEEJNtwwS1DDhhkj1JLBeMDwzCp5kRg5wBk1HuGzV7D-28sry1Bp3oT7zvnd2YVjmRmcBEW2cPxUo0XOI9fjMm4r5RlJOGeofHEv4W7MdQtNEe0aqeLU10Ggo5S7USySlDy9rr8FtWyYmW1gnm5jA2O4rwgXCDWSWMQS39Gy8rXkDXCrBQoTC1tO7Bn9cAa4TBMe4oSH5YSHfgOOp22eJqAdv9ZuVuseWgHOQ7RKgzZBGwUNOKnWeVb8c287f6u-C0seRcmUUW1NqBWjsdmDxeS56OWj_XJjvwMMKO_x priority: 102 providerName: Springer Nature |
| Title | The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm |
| URI | https://link.springer.com/article/10.1007/s10898-020-00947-3 https://www.proquest.com/docview/2494709724 |
| Volume | 79 |
| WOSCitedRecordID | wos000568481700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-2916 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009852 issn: 0925-5001 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NTtwwEB6Vn0N7gEKLurAgHziAwMJx4o1zqmAFQkIsET8tIKEoiR1ppd0s7C48A0_Bw_EknQneplSCC5dRIsdOpLEnM57x9wGsG6PTSCnFrWoVPAgiXHPKKq4wvk2DVLWwvSKbCDsdfXkZxW7DbeTKKic2sTLUZpDTHvkOhglBSFgzwc_bO06sUZRddRQaUzCDno1HJV3HMq5Bd3XFuCMiiS9He-wOzbijc5oOl0k6V40jc__1j6n2Nv9LkFb_nYP5j37xV5hzHifbfZkiC_DJlovw5R8cwkVYcCt8xDYcDPXmN7jBGcR6RKLGMuJesoZ1SyrisGyAdqaPYxJSuGWOk4YNSkZAJf37PkMzVVEhMcp5M-o8RNkds97z4xMr0U_-DhcH--ftQ-7IGHiOq3TM_cJgEC5STwqdhVEkrSZoM_S3hMyFlwnTwujDeFZHWeGbIDBpIbw0U3lByV3PX4LpclDaH8CkCbGDtcKPCAoInZBMZRqvMZjyjRYN8CaaSHKHVE6EGb2kxlgm7SWovaTSXuI3YOtvn9sXnI53n25OVJa4NTtKan01YHui9Lr57dGW3x9tBT5LKoSpCteaMD0e3ttVmM0fxt3RcA2mwt9XazCzt9-JT_HuKOQoj0WbpDypZEwyPEMZq2uUp2e__gALlvdq |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NTttAEB7xU4n2AE2gagq0e2glELVYr73J-oAQgiKihIhDKuWCXNu7liIlTpqEVn2DPgWPwEP1STrjrDFFKrccuFiW7F1pvd_Oznhnvg_go9YqCqSUjpH11PH9ANecNNKRGN9GfiTr-DwXm2h0OqrXC66W4K6ohaG0ysIm5oZajxL6R36IYYLfIK4Z_3j83SHVKDpdLSQ05rBomV8_MWSbHjXPcH4_CXH-pXt64VhVASdBuM0cL9UYTfLIFVzFjSAQRhFHFzoOXCTcjbmuoxutXaOCOPW07-so5W4UyySlU0rXw36XYdUnZjFKFRRXJcmvyhV-eCBwsGj_bZGOLdVTVMwmqI4bR-J4_26EpXf76EA23-fON57bF3oN69ajZifzJVCBJZNV4dUDnsUqVKwFm7I9S7O9vwnXuELYgETiWEzaUkazfkZJKoaN0I4OsU9iQjfMau6wUcaIiGV4M2RohnOpJ0Zn-owaT_Dan7HBn9-3LMM4YAu-LmTQb2AlG2XmLTChG9jAGO4FRHWETlYsY4X3GCx6WvEauMXMh4llYidBkEFYckgTWkJES5ijJfRqcHDfZjznIXny7Z0CIqG1SdOwxEcNPhcgKx__v7d3T_f2AdYuupftsN3stLbhpaCknzxJbwdWZpMbswsvkh-z_nTyPl8tDL4tGnx_AaerShw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3BattAEB3cpJT2kNRuSt0k7R5aaGlEViuttTqEEJKaGBfjQwumUBRJuwKDLae205I_yFfkQ_I5-ZLMyKuqKdQ3H3IRgtUurPR2dkY78x7AO61VHEopHSNbmeP7Ia45aaQjMb6N_Vi2sL0Qmwh6PTUYhP0a3JS1MJRWWdrEwlDrSUr_yPcxTPAD4prx9zObFtE_aR-e_3RIQYpOWks5jQVEuubyN4Zvs4POCX7r90K0P389PnWswoCTIvTmjpdpjCx57AqukiAMhVHE14VOBBcpdxOuW-hSa9eoMMk87fs6zrgbJzLN6MTS9XDcR7AeYIxJ6YR9-b0i_FWF2g8PBU4c9wJbsGPL9hQVtgmq6cZZOd79TbHydP85nC32vPbmQ35bz2HDetrsaLE06lAzeQOe_cW_2IC6tWwz9sHSb398AT9w5bARicexhDSnjGbDnJJXDJugfR3jmMSQbpjV4mGTnBFBy_hizNA8FxJQjM76GXWe4nU4Z6Pbq2uWY3ywBd9WMumXsJZPcvMKmNABdjCGeyFRIKHzlchE4T0GkZ5WvAluiYIotQztJBQyiipuaUJOhMiJCuREXhM-_elzvuAnWfr0TgmXyNqqWVRhpQl7JeCq5v-P9nr5aG_hCWIu-tLpdbfhqaBcoCJ3bwfW5tMLswuP01_z4Wz6plg4DM5Wjb073jpTCA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+lower+bounded+inverse+optimal+value+problem+on+minimum+spanning+tree+under+unit+l%E2%88%9E+norm&rft.jtitle=Journal+of+global+optimization&rft.au=Zhang+Binwu&rft.au=Guan+Xiucui&rft.au=Pardalos%2C+Panos+M&rft.au=Wang%2C+Hui&rft.date=2021-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=79&rft.issue=3&rft.spage=757&rft.epage=777&rft_id=info:doi/10.1007%2Fs10898-020-00947-3&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon |