Anisi1371
سه شنبه 16 خرداد 1391, 02:11 صبح
دوستان سلام
می خوام یک متن رو تجزیه کنم.
مثلا می خوام از صفحه زیر :
<div id="gs_ccl"> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf" class=yC0><b>Local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://miplib.zib.de/miplib2003/paper/fischettilodi2002_pp.pdf" class=yC1><span class=gs_ctg2>[PDF]</span> from zib.de</a></div><div class="gs_a">M Fischetti… - Mathematical Programming, 2003 - Springer</div><div class="gs_rs">The availability of effective exact or heuristic solution methods for general Mixed-Integer <br>Programs (MIPs) is of paramount importance for practical applications. In the present paper <br>we investigate the use of a generic MIP solver as a black-box``tactical''tool to explore <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=15268679717299135345&as_sdt=2005&sci odt=0,5&hl=en">Cited by 347</a> - <a href="/scholar?q=related:caPTUk4_5dMJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=15268679717299135345&hl=en&as_sdt= 0,5&as_vis=1">All 25 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.sciencedirect.com/science/article/pii/S0305054805000894" class=yC2>Variable neighborhood search and <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://www.carisma.brunel.ac.uk/papers/2006/Nen2.pdf" class=yC3><span class=gs_ctg2>[PDF]</span> from brunel.ac.uk</a></div><div class="gs_a">P Hansen, N Mladenovic… - Computers & Operations Research, 2006 - Elsevier</div><div class="gs_rs">In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-<br>integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. <br>Neighborhoods around the incumbent solution are defined by adding constraints to the <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=12244402966343288575&as_sdt=2005&sci odt=0,5&hl=en">Cited by 60</a> - <a href="/scholar?q=related:_4ahz5_b7KkJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=12244402966343288575&hl=en&as_sdt= 0,5&as_vis=1">All 14 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><span class="gs_ctc">[BOOK]</span> <a href="http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf" class=yC4>Accelerating Benders decomposition by <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf" class=yC5><span class=gs_ctg2>[PDF]</span> from concordia.ca</a></div><div class="gs_a">W Rei… - 2006 - cs.concordia.ca</div><div class="gs_rs">This paper explains how <b>local branching </b>can be used to accelerate the classical Benders <br>decomposition algorithm. By applying <b>local branching </b>throughout the solution process, one <br>can simultaneously improve both the lower and upper bounds. We also show how <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=3552160910829273186&as_sdt=2005&scio dt=0,5&hl=en">Cited by 38</a> - <a href="/scholar?q=related:YsABO4fPSzEJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://scholar.googleusercontent.com/scholar?q=cache:YsABO4fPSzEJ:scholar.google.com/+%22Local+branching%22&hl=en&as_sdt=0,5&as_vis=1">View as HTML</a> - <a href="/scholar?cluster=3552160910829273186&hl=en&as_sdt=0 ,5&as_vis=1">All 13 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://onlinelibrary.wiley.com/doi/10.1002/net.20017/abstract" class=yC6>A <b>local branching </b>heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem</a></h3><div class="gs_ggs gs_fl"><a href="http://www.dei.unipd.it/~fisch/papers/local_branching_heuristic_mips_2_level_vars.pdf" class=yC7><span class=gs_ctg2>[PDF]</span> from unipd.it</a></div><div class="gs_a">M Fischetti, C Polo… - Networks, 2004 - Wiley Online Library</div><div class="gs_rs">Abstract Effective heuristic solution methods for general Mixed-Integer Programs (MIPs) are <br>strongly required in many practical applications, and have been the subject of an intensive <br>research effort in the recent years. Fischetti and Lodi recently proposed an exact solution <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=2931575749682443012&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:BLP4t5wMrygJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/37/44/RN155160780.html?source=googlescholar" class=yC8>BL Direct</a> - <a href="/scholar?cluster=2931575749682443012&hl=en&as_sdt=0 ,5&as_vis=1">All 5 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/5lv0mhv377k35042.pdf" class=yC9>Syntactic detection of process divergence and non-local choice in message sequence charts</a></h3><div class="gs_ggs gs_fl"><a href="https://kops.ub.uni-konstanz.de/xmlui/handle/id-12/browse?offset=520&type=type&value=conferenceObject" class=yCA><span class=gs_ctg2>[HTML]</span> from uni-konstanz.de</a></div><div class="gs_a"><a href="/citations?hl=en&user=FQBMQBkAAAAJ&oi=sra">H Ben-Abdallah</a>… - Tools and Algorithms for the Construction and …, 1997 - Springer</div><div class="gs_rs"><b>...</b> In this paper we characterize two consequences of harmful underspecifica- tions:<br>
process divergence and non-<b>local</b> <b>branching</b> choice. We also present two syntax-based<br>
analysis algorithms that detect both problems. 1 Introduction <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=1184075760829454853&as_sdt=2005&scio dt=0,5&hl=en">Cited by 141</a> - <a href="/scholar?q=related:Bdpjh6GubhAJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/57/25/RN024208886.html?source=googlescholar" class=yCB>BL Direct</a> - <a href="/scholar?cluster=1184075760829454853&hl=en&as_sdt=0 ,5&as_vis=1">All 10 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/l4n3k8ky7y94tk3r.pdf" class=yCC>Detecting implied scenarios analyzing non-<b>local branching </b>choices</a></h3><div class="gs_ggs gs_fl"><a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.94.8492&rep=rep1&type=pdf" class=yCD><span class=gs_ctg2>[PDF]</span> from psu.edu</a></div><div class="gs_a"><a href="/citations?hl=en&user=5n9E1cMAAAAJ&oi=sra">H Muccini</a> - Fundamental Approaches to Software Engineering, 2003 - Springer</div><div class="gs_rs">Scenarios are powerful tools to model and analyze software systems. However, since they <br>do not provide a complete description of the system, but just some possible execution paths, <br>they are usually integrated with state machines. State machines may be extracted from <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=4855581646037018508&as_sdt=2005&scio dt=0,5&hl=en">Cited by 23</a> - <a href="/scholar?q=related:jGfx9cd9YkMJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/53/2B/RN128526146.html?source=googlescholar" class=yCE>BL Direct</a> - <a href="/scholar?cluster=4855581646037018508&hl=en&as_sdt=0 ,5&as_vis=1">All 10 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://link.aps.org/doi/10.1103/PhysRevLett.74.5096" class=yCF>Local crack branching as a mechanism for instability in dynamic fracture</a></h3><div class="gs_ggs gs_fl"><a href="http://www.phys.huji.ac.il/~jay/publications/Fracture/Sharon%20et%20al%20Local%20Branching%20PRL74.pdf" class=yC10><span class=gs_ctg2>[PDF]</span> from huji.ac.il</a></div><div class="gs_a">E Sharon, <a href="/citations?hl=en&user=42fU-rsAAAAJ&oi=sra">SP Gross</a>… - Physical Review Letters, 1995 - APS</div><div class="gs_rs"><b>...</b> about 0.6V~. Moreover, numerical solutions of the model for v )0.6V~ exhibit the<br>
periodic occurrence of <b>local</b> <b>branching</b> events where the main crack sprouts side<br>
branches that propagate for a short distance and die. The spacing <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=7778843560866035884&as_sdt=2005&scio dt=0,5&hl=en">Cited by 207</a> - <a href="/scholar?q=related:rDjBKAEB9GsJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/12/56/EN028250710.html?source=googlescholar" class=yC11>BL Direct</a> - <a href="/scholar?cluster=7778843560866035884&hl=en&as_sdt=0 ,5&as_vis=1">All 9 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.sciencedirect.com/science/article/pii/S0305054806001900" class=yC12>Repairing MIP infeasibility through <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://domino.watson.ibm.com/library/cyberdig.nsf/papers/89757F73A3456D9785256FB800520A71/$File/rc23532.pdf" class=yC13><span class=gs_ctg2>[PDF]</span> from ibm.com</a></div><div class="gs_a">M Fischetti… - Computers & operations research, 2008 - Elsevier</div><div class="gs_rs">Finding a feasible solution to a generic mixed-integer linear program (MIP) is often a very <br>difficult task. Recently, two heuristic approaches called feasibility pump and <b>local branching </b><br>have been proposed to address the problem of finding a feasible solution and improving it<b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=4571307599323494823&as_sdt=2005&scio dt=0,5&hl=en">Cited by 13</a> - <a href="/scholar?q=related:p3m4sAqMcD8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4571307599323494823&hl=en&as_sdt=0 ,5&as_vis=1">All 9 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.csa.com/partners/viewrecord.php?requester=gs&collection=TRD&recid=8 002310465MD" class=yC14>Profilometric analysis of fractures</a></h3><div class="gs_a">SM El-Soudani - Metallography, 1978 - csa.com</div><div class="gs_rs"><b>...</b> The crack branching-index theorem shows that crack branching is a cumulative process, whereby<br>
global branching indexes are summations of <b>local</b> <b>branching</b> probabilities multiplied by <b>local</b><br>
<b>branching</b> indexes which are defined for infinitesimal profile elements. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=4556942712740203702&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:tkyv5kCDPT8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4556942712740203702&hl=en&as_sdt=0 ,5&as_vis=1">All 2 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf" class=yC15>Exploring relaxation induced neighborhoods to improve MIP solutions</a></h3><div class="gs_ggs gs_fl"><a href="http://page.math.tu-berlin.de/~luebbeck/teaching/computMIP0708/paper/RINS.pdf" class=yC16><span class=gs_ctg2>[PDF]</span> from tu-berlin.de</a></div><div class="gs_a">E Danna, E Rothberg… - Mathematical Programming, 2005 - Springer</div><div class="gs_rs"><b>...</b> A recently proposed approach called <b>local</b> <b>branching</b> [17] provides one set of an- swers<br>
to these three questions. This paper introduces two new approaches. <b>...</b> We present RINS<br>
and guided dives, and also discuss <b>local</b> <b>branching</b> [17]. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=10999127073638175581&as_sdt=2005&sci odt=0,5&hl=en">Cited by 192</a> - <a href="/scholar?q=related:XdOVL8y_pJgJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=10999127073638175581&hl=en&as_sdt= 0,5&as_vis=1">All 11 versions</a></div></div> <p id="gs_alrt_btm"><a href="/scholar_alerts?view_op=create_alert_options&hl=en& alert_query=%22Local+branching%22&alert_params=hl% 3Den%26as_sdt%3D0,5" class="gs_btnM gs_in_ib"><span class="gs_lbl">Create email alert</span><span class="gs_ico"></span></a></p><div id="gs_n"><center><table cellpadding="0" width="1%"><tr align="center" valign="top"><td align="right" nowrap><span class="gs_ico gs_ico_nav_first"></span><b style="display:block;margin-right:28px;visibility:hidden">Previous</b></td><td><span class="gs_ico gs_ico_nav_current"></span><b>1</b></td><td><a href="/scholar?start=10&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>2</a></td><td><a href="/scholar?start=20&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>3</a></td><td><a href="/scholar?start=30&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>4</a></td><td><a href="/scholar?start=40&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>5</a></td><td><a href="/scholar?start=50&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>6</a></td><td><a href="/scholar?start=60&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>7</a></td><td><a href="/scholar?start=70&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>8</a></td><td><a href="/scholar?start=80&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>9</a></td><td><a href="/scholar?start=90&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>10</a></td><td align="left" nowrap><a href="/scholar?start=10&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_next"></span><b style="display:block;margin-left:50px">Next</b></a></td></tr></table></center></div><div id="gs_ftr"><a href="/intl/en/scholar/about.html">About Google Scholar</a><a href="http://www.google.com/intl/en/about.html">All About Google</a><a href="http://www.google.com/intl/en/privacy.html">Privacy & Terms</a></div><style>.yC0:active,.yC0:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=0&url=http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC1:active,.yC1:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=0&url=http://miplib.zib.de/miplib2003/paper/fischettilodi2002_pp.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC2:active,.yC2:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=1&url=http://www.sciencedirect.com/science/article/pii/S0305054805000894&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC3:active,.yC3:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=1&url=http://www.carisma.brunel.ac.uk/papers/2006/Nen2.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC4:active,.yC4:focus:hover{background:url("/scholar_url?sa=T&oi=ggp&ct=res&cd=2&url=http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC5:active,.yC5:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=2&url=http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC6:active,.yC6:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=3&url=http://onlinelibrary.wiley.com/doi/10.1002/net.20017/abstract&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC7:active,.yC7:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=3&url=http://www.dei.unipd.it/~fisch/papers/local_branching_heuristic_mips_2_level_vars.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC8:active,.yC8:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=3&url=http://direct.bl.uk/research/37/44/RN155160780.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC9:active,.yC9:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=4&url=http://www.springerlink.com/index/5lv0mhv377k35042.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCA:active,.yCA:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=4&url=https://kops.ub.uni-konstanz.de/xmlui/handle/id-12/browse%3Foffset%3D520%26type%3Dtype%26value%3Dconf erenceObject&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCB:active,.yCB:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=4&url=http://direct.bl.uk/research/57/25/RN024208886.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCC:active,.yCC:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=5&url=http://www.springerlink.com/index/l4n3k8ky7y94tk3r.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCD:active,.yCD:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=5&url=http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi%3D10.1.1.94.8492%26rep%3Drep1%26typ e%3Dpdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCE:active,.yCE:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=5&url=http://direct.bl.uk/research/53/2B/RN128526146.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCF:active,.yCF:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=6&url=http://link.aps.org/doi/10.1103/PhysRevLett.74.5096&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC10:active,.yC10:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=6&url=http://www.phys.huji.ac.il/~jay/publications/Fracture/Sharon%2520et%2520al%2520Local%2520Branching%2520P RL74.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC11:active,.yC11:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=6&url=http://direct.bl.uk/research/12/56/EN028250710.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC12:active,.yC12:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=7&url=http://www.sciencedirect.com/science/article/pii/S0305054806001900&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC13:active,.yC13:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=7&url=http://domino.watson.ibm.com/library/cyberdig.nsf/papers/89757F73A3456D9785256FB800520A71/%24File/rc23532.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC14:active,.yC14:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=8&url=http://www.csa.com/partners/viewrecord.php%3Frequester%3Dgs%26collection%3DTRD %26recid%3D8002310465MD&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC15:active,.yC15:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=9&url=http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC16:active,.yC16:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=9&url=http://page.math.tu-berlin.de/~luebbeck/teaching/computMIP0708/paper/RINS.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}</style></div></div></div></div></body></html>
عبارات شبیه به عبارات زیر رو استخراج کنم:
<h3 class="gs_rt"><a href="http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf" class=yC0><b>Local branching</b></a></h3>
<a href="/scholar?cites=15268679717299135345&as_sdt=2005&sci odt=0,5&hl=en">Cited by 347</a>
و از الگوی زیر استفاده کردم:
<h3 [a-zA-Z0-9\s\t="_><:/\.\\-&*#\']*</a></h3>|<a href="/scholar\?cites=[a-zA-Z0-9&-_]*">Cited by [0-9]*</a>
اما مشکل اینه که به جای عبارتی شبیه به عبارت بالا بعضی وقتا عبارت مثل عبارت زیر رو تحویل میده:
<h3 class="gs_rt"><a href="http://www.csa.com/partners/viewrecord.php?requester=gs&collection=TRD&recid=8 002310465MD" class=yC14>Profilometric analysis of fractures</a></h3><div class="gs_a">SM El-Soudani - Metallography, 1978 - csa.com</div><div class="gs_rs"><b>...</b> The crack branching-index theorem shows that crack branching is a cumulative process, whereby<br>
global branching indexes are summations of <b>local</b> <b>branching</b> probabilities multiplied by <b>local</b><br>
<b>branching</b> indexes which are defined for infinitesimal profile elements. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=4556942712740203702&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:tkyv5kCDPT8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4556942712740203702&hl=en&as_sdt=0 ,5&as_vis=1">All 2 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf" class=yC15>Exploring relaxation induced neighborhoods to improve MIP solutions</a></h3>
<a href="/scholar?cites=10999127073638175581&as_sdt=2005&sci odt=0,5&hl=en">Cited by 192</a>
یعنی میاد به جای جدا کردن لینک اول تا آخرین لینکی که هست رو انتخاب می کنه!
کلافه شدم و نمی تونم مشکل رو حل کنم. لطف می کنید بگید اشکال از کجای الگو هست؟
ممنون
می خوام یک متن رو تجزیه کنم.
مثلا می خوام از صفحه زیر :
<div id="gs_ccl"> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf" class=yC0><b>Local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://miplib.zib.de/miplib2003/paper/fischettilodi2002_pp.pdf" class=yC1><span class=gs_ctg2>[PDF]</span> from zib.de</a></div><div class="gs_a">M Fischetti… - Mathematical Programming, 2003 - Springer</div><div class="gs_rs">The availability of effective exact or heuristic solution methods for general Mixed-Integer <br>Programs (MIPs) is of paramount importance for practical applications. In the present paper <br>we investigate the use of a generic MIP solver as a black-box``tactical''tool to explore <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=15268679717299135345&as_sdt=2005&sci odt=0,5&hl=en">Cited by 347</a> - <a href="/scholar?q=related:caPTUk4_5dMJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=15268679717299135345&hl=en&as_sdt= 0,5&as_vis=1">All 25 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.sciencedirect.com/science/article/pii/S0305054805000894" class=yC2>Variable neighborhood search and <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://www.carisma.brunel.ac.uk/papers/2006/Nen2.pdf" class=yC3><span class=gs_ctg2>[PDF]</span> from brunel.ac.uk</a></div><div class="gs_a">P Hansen, N Mladenovic… - Computers & Operations Research, 2006 - Elsevier</div><div class="gs_rs">In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-<br>integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. <br>Neighborhoods around the incumbent solution are defined by adding constraints to the <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=12244402966343288575&as_sdt=2005&sci odt=0,5&hl=en">Cited by 60</a> - <a href="/scholar?q=related:_4ahz5_b7KkJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=12244402966343288575&hl=en&as_sdt= 0,5&as_vis=1">All 14 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><span class="gs_ctc">[BOOK]</span> <a href="http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf" class=yC4>Accelerating Benders decomposition by <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf" class=yC5><span class=gs_ctg2>[PDF]</span> from concordia.ca</a></div><div class="gs_a">W Rei… - 2006 - cs.concordia.ca</div><div class="gs_rs">This paper explains how <b>local branching </b>can be used to accelerate the classical Benders <br>decomposition algorithm. By applying <b>local branching </b>throughout the solution process, one <br>can simultaneously improve both the lower and upper bounds. We also show how <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=3552160910829273186&as_sdt=2005&scio dt=0,5&hl=en">Cited by 38</a> - <a href="/scholar?q=related:YsABO4fPSzEJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://scholar.googleusercontent.com/scholar?q=cache:YsABO4fPSzEJ:scholar.google.com/+%22Local+branching%22&hl=en&as_sdt=0,5&as_vis=1">View as HTML</a> - <a href="/scholar?cluster=3552160910829273186&hl=en&as_sdt=0 ,5&as_vis=1">All 13 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://onlinelibrary.wiley.com/doi/10.1002/net.20017/abstract" class=yC6>A <b>local branching </b>heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem</a></h3><div class="gs_ggs gs_fl"><a href="http://www.dei.unipd.it/~fisch/papers/local_branching_heuristic_mips_2_level_vars.pdf" class=yC7><span class=gs_ctg2>[PDF]</span> from unipd.it</a></div><div class="gs_a">M Fischetti, C Polo… - Networks, 2004 - Wiley Online Library</div><div class="gs_rs">Abstract Effective heuristic solution methods for general Mixed-Integer Programs (MIPs) are <br>strongly required in many practical applications, and have been the subject of an intensive <br>research effort in the recent years. Fischetti and Lodi recently proposed an exact solution <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=2931575749682443012&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:BLP4t5wMrygJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/37/44/RN155160780.html?source=googlescholar" class=yC8>BL Direct</a> - <a href="/scholar?cluster=2931575749682443012&hl=en&as_sdt=0 ,5&as_vis=1">All 5 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/5lv0mhv377k35042.pdf" class=yC9>Syntactic detection of process divergence and non-local choice in message sequence charts</a></h3><div class="gs_ggs gs_fl"><a href="https://kops.ub.uni-konstanz.de/xmlui/handle/id-12/browse?offset=520&type=type&value=conferenceObject" class=yCA><span class=gs_ctg2>[HTML]</span> from uni-konstanz.de</a></div><div class="gs_a"><a href="/citations?hl=en&user=FQBMQBkAAAAJ&oi=sra">H Ben-Abdallah</a>… - Tools and Algorithms for the Construction and …, 1997 - Springer</div><div class="gs_rs"><b>...</b> In this paper we characterize two consequences of harmful underspecifica- tions:<br>
process divergence and non-<b>local</b> <b>branching</b> choice. We also present two syntax-based<br>
analysis algorithms that detect both problems. 1 Introduction <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=1184075760829454853&as_sdt=2005&scio dt=0,5&hl=en">Cited by 141</a> - <a href="/scholar?q=related:Bdpjh6GubhAJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/57/25/RN024208886.html?source=googlescholar" class=yCB>BL Direct</a> - <a href="/scholar?cluster=1184075760829454853&hl=en&as_sdt=0 ,5&as_vis=1">All 10 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/l4n3k8ky7y94tk3r.pdf" class=yCC>Detecting implied scenarios analyzing non-<b>local branching </b>choices</a></h3><div class="gs_ggs gs_fl"><a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.94.8492&rep=rep1&type=pdf" class=yCD><span class=gs_ctg2>[PDF]</span> from psu.edu</a></div><div class="gs_a"><a href="/citations?hl=en&user=5n9E1cMAAAAJ&oi=sra">H Muccini</a> - Fundamental Approaches to Software Engineering, 2003 - Springer</div><div class="gs_rs">Scenarios are powerful tools to model and analyze software systems. However, since they <br>do not provide a complete description of the system, but just some possible execution paths, <br>they are usually integrated with state machines. State machines may be extracted from <b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=4855581646037018508&as_sdt=2005&scio dt=0,5&hl=en">Cited by 23</a> - <a href="/scholar?q=related:jGfx9cd9YkMJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/53/2B/RN128526146.html?source=googlescholar" class=yCE>BL Direct</a> - <a href="/scholar?cluster=4855581646037018508&hl=en&as_sdt=0 ,5&as_vis=1">All 10 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://link.aps.org/doi/10.1103/PhysRevLett.74.5096" class=yCF>Local crack branching as a mechanism for instability in dynamic fracture</a></h3><div class="gs_ggs gs_fl"><a href="http://www.phys.huji.ac.il/~jay/publications/Fracture/Sharon%20et%20al%20Local%20Branching%20PRL74.pdf" class=yC10><span class=gs_ctg2>[PDF]</span> from huji.ac.il</a></div><div class="gs_a">E Sharon, <a href="/citations?hl=en&user=42fU-rsAAAAJ&oi=sra">SP Gross</a>… - Physical Review Letters, 1995 - APS</div><div class="gs_rs"><b>...</b> about 0.6V~. Moreover, numerical solutions of the model for v )0.6V~ exhibit the<br>
periodic occurrence of <b>local</b> <b>branching</b> events where the main crack sprouts side<br>
branches that propagate for a short distance and die. The spacing <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=7778843560866035884&as_sdt=2005&scio dt=0,5&hl=en">Cited by 207</a> - <a href="/scholar?q=related:rDjBKAEB9GsJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="http://direct.bl.uk/research/12/56/EN028250710.html?source=googlescholar" class=yC11>BL Direct</a> - <a href="/scholar?cluster=7778843560866035884&hl=en&as_sdt=0 ,5&as_vis=1">All 9 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.sciencedirect.com/science/article/pii/S0305054806001900" class=yC12>Repairing MIP infeasibility through <b>local branching</b></a></h3><div class="gs_ggs gs_fl"><a href="http://domino.watson.ibm.com/library/cyberdig.nsf/papers/89757F73A3456D9785256FB800520A71/$File/rc23532.pdf" class=yC13><span class=gs_ctg2>[PDF]</span> from ibm.com</a></div><div class="gs_a">M Fischetti… - Computers & operations research, 2008 - Elsevier</div><div class="gs_rs">Finding a feasible solution to a generic mixed-integer linear program (MIP) is often a very <br>difficult task. Recently, two heuristic approaches called feasibility pump and <b>local branching </b><br>have been proposed to address the problem of finding a feasible solution and improving it<b> ...</b></div><div class="gs_fl"><a href="/scholar?cites=4571307599323494823&as_sdt=2005&scio dt=0,5&hl=en">Cited by 13</a> - <a href="/scholar?q=related:p3m4sAqMcD8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4571307599323494823&hl=en&as_sdt=0 ,5&as_vis=1">All 9 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.csa.com/partners/viewrecord.php?requester=gs&collection=TRD&recid=8 002310465MD" class=yC14>Profilometric analysis of fractures</a></h3><div class="gs_a">SM El-Soudani - Metallography, 1978 - csa.com</div><div class="gs_rs"><b>...</b> The crack branching-index theorem shows that crack branching is a cumulative process, whereby<br>
global branching indexes are summations of <b>local</b> <b>branching</b> probabilities multiplied by <b>local</b><br>
<b>branching</b> indexes which are defined for infinitesimal profile elements. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=4556942712740203702&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:tkyv5kCDPT8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4556942712740203702&hl=en&as_sdt=0 ,5&as_vis=1">All 2 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf" class=yC15>Exploring relaxation induced neighborhoods to improve MIP solutions</a></h3><div class="gs_ggs gs_fl"><a href="http://page.math.tu-berlin.de/~luebbeck/teaching/computMIP0708/paper/RINS.pdf" class=yC16><span class=gs_ctg2>[PDF]</span> from tu-berlin.de</a></div><div class="gs_a">E Danna, E Rothberg… - Mathematical Programming, 2005 - Springer</div><div class="gs_rs"><b>...</b> A recently proposed approach called <b>local</b> <b>branching</b> [17] provides one set of an- swers<br>
to these three questions. This paper introduces two new approaches. <b>...</b> We present RINS<br>
and guided dives, and also discuss <b>local</b> <b>branching</b> [17]. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=10999127073638175581&as_sdt=2005&sci odt=0,5&hl=en">Cited by 192</a> - <a href="/scholar?q=related:XdOVL8y_pJgJ:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=10999127073638175581&hl=en&as_sdt= 0,5&as_vis=1">All 11 versions</a></div></div> <p id="gs_alrt_btm"><a href="/scholar_alerts?view_op=create_alert_options&hl=en& alert_query=%22Local+branching%22&alert_params=hl% 3Den%26as_sdt%3D0,5" class="gs_btnM gs_in_ib"><span class="gs_lbl">Create email alert</span><span class="gs_ico"></span></a></p><div id="gs_n"><center><table cellpadding="0" width="1%"><tr align="center" valign="top"><td align="right" nowrap><span class="gs_ico gs_ico_nav_first"></span><b style="display:block;margin-right:28px;visibility:hidden">Previous</b></td><td><span class="gs_ico gs_ico_nav_current"></span><b>1</b></td><td><a href="/scholar?start=10&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>2</a></td><td><a href="/scholar?start=20&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>3</a></td><td><a href="/scholar?start=30&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>4</a></td><td><a href="/scholar?start=40&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>5</a></td><td><a href="/scholar?start=50&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>6</a></td><td><a href="/scholar?start=60&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>7</a></td><td><a href="/scholar?start=70&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>8</a></td><td><a href="/scholar?start=80&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>9</a></td><td><a href="/scholar?start=90&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_page"></span>10</a></td><td align="left" nowrap><a href="/scholar?start=10&q=%22Local+branching%22&hl=en&as_ sdt=0,5&as_vis=1"><span class="gs_ico gs_ico_nav_next"></span><b style="display:block;margin-left:50px">Next</b></a></td></tr></table></center></div><div id="gs_ftr"><a href="/intl/en/scholar/about.html">About Google Scholar</a><a href="http://www.google.com/intl/en/about.html">All About Google</a><a href="http://www.google.com/intl/en/privacy.html">Privacy & Terms</a></div><style>.yC0:active,.yC0:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=0&url=http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC1:active,.yC1:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=0&url=http://miplib.zib.de/miplib2003/paper/fischettilodi2002_pp.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC2:active,.yC2:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=1&url=http://www.sciencedirect.com/science/article/pii/S0305054805000894&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC3:active,.yC3:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=1&url=http://www.carisma.brunel.ac.uk/papers/2006/Nen2.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC4:active,.yC4:focus:hover{background:url("/scholar_url?sa=T&oi=ggp&ct=res&cd=2&url=http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC5:active,.yC5:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=2&url=http://www.cs.concordia.ca/~chvatal/workshop06/gendreau.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC6:active,.yC6:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=3&url=http://onlinelibrary.wiley.com/doi/10.1002/net.20017/abstract&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC7:active,.yC7:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=3&url=http://www.dei.unipd.it/~fisch/papers/local_branching_heuristic_mips_2_level_vars.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC8:active,.yC8:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=3&url=http://direct.bl.uk/research/37/44/RN155160780.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC9:active,.yC9:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=4&url=http://www.springerlink.com/index/5lv0mhv377k35042.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCA:active,.yCA:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=4&url=https://kops.ub.uni-konstanz.de/xmlui/handle/id-12/browse%3Foffset%3D520%26type%3Dtype%26value%3Dconf erenceObject&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCB:active,.yCB:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=4&url=http://direct.bl.uk/research/57/25/RN024208886.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCC:active,.yCC:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=5&url=http://www.springerlink.com/index/l4n3k8ky7y94tk3r.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCD:active,.yCD:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=5&url=http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi%3D10.1.1.94.8492%26rep%3Drep1%26typ e%3Dpdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCE:active,.yCE:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=5&url=http://direct.bl.uk/research/53/2B/RN128526146.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yCF:active,.yCF:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=6&url=http://link.aps.org/doi/10.1103/PhysRevLett.74.5096&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC10:active,.yC10:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=6&url=http://www.phys.huji.ac.il/~jay/publications/Fracture/Sharon%2520et%2520al%2520Local%2520Branching%2520P RL74.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC11:active,.yC11:focus:hover{background:url("/scholar_url?sa=T&ct=docdel&cd=6&url=http://direct.bl.uk/research/12/56/EN028250710.html%3Fsource%3Dgooglescholar&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC12:active,.yC12:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=7&url=http://www.sciencedirect.com/science/article/pii/S0305054806001900&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC13:active,.yC13:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=7&url=http://domino.watson.ibm.com/library/cyberdig.nsf/papers/89757F73A3456D9785256FB800520A71/%24File/rc23532.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC14:active,.yC14:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=8&url=http://www.csa.com/partners/viewrecord.php%3Frequester%3Dgs%26collection%3DTRD %26recid%3D8002310465MD&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC15:active,.yC15:focus:hover{background:url("/scholar_url?sa=T&ct=res&cd=9&url=http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}.yC16:active,.yC16:focus:hover{background:url("/scholar_url?sa=T&oi=gga&ct=gga&cd=9&url=http://page.math.tu-berlin.de/~luebbeck/teaching/computMIP0708/paper/RINS.pdf&ei=RyTNT_3gPIiQ6AKlxpybBg")}</style></div></div></div></div></body></html>
عبارات شبیه به عبارات زیر رو استخراج کنم:
<h3 class="gs_rt"><a href="http://www.springerlink.com/index/5PENP1K3RJ50RPDM.pdf" class=yC0><b>Local branching</b></a></h3>
<a href="/scholar?cites=15268679717299135345&as_sdt=2005&sci odt=0,5&hl=en">Cited by 347</a>
و از الگوی زیر استفاده کردم:
<h3 [a-zA-Z0-9\s\t="_><:/\.\\-&*#\']*</a></h3>|<a href="/scholar\?cites=[a-zA-Z0-9&-_]*">Cited by [0-9]*</a>
اما مشکل اینه که به جای عبارتی شبیه به عبارت بالا بعضی وقتا عبارت مثل عبارت زیر رو تحویل میده:
<h3 class="gs_rt"><a href="http://www.csa.com/partners/viewrecord.php?requester=gs&collection=TRD&recid=8 002310465MD" class=yC14>Profilometric analysis of fractures</a></h3><div class="gs_a">SM El-Soudani - Metallography, 1978 - csa.com</div><div class="gs_rs"><b>...</b> The crack branching-index theorem shows that crack branching is a cumulative process, whereby<br>
global branching indexes are summations of <b>local</b> <b>branching</b> probabilities multiplied by <b>local</b><br>
<b>branching</b> indexes which are defined for infinitesimal profile elements. <b>...</b>
</div><div class="gs_fl"><a href="/scholar?cites=4556942712740203702&as_sdt=2005&scio dt=0,5&hl=en">Cited by 29</a> - <a href="/scholar?q=related:tkyv5kCDPT8J:scholar.google.com/&hl=en&as_sdt=0,5&as_vis=1">Related articles</a> - <a href="/scholar?cluster=4556942712740203702&hl=en&as_sdt=0 ,5&as_vis=1">All 2 versions</a></div></div> <div class="gs_r"><h3 class="gs_rt"><a href="http://www.springerlink.com/index/YVEHLCMJ74LPNEW8.pdf" class=yC15>Exploring relaxation induced neighborhoods to improve MIP solutions</a></h3>
<a href="/scholar?cites=10999127073638175581&as_sdt=2005&sci odt=0,5&hl=en">Cited by 192</a>
یعنی میاد به جای جدا کردن لینک اول تا آخرین لینکی که هست رو انتخاب می کنه!
کلافه شدم و نمی تونم مشکل رو حل کنم. لطف می کنید بگید اشکال از کجای الگو هست؟
ممنون