{"id":"https://openalex.org/W1989257897","doi":"https://doi.org/10.1016/s0377-2217(97)00362-7","title":"Model tightening for integrated timber harvest and transportation planning","display_name":"Model tightening for integrated timber harvest and transportation planning","publication_year":1998,"publication_date":"1998-12-01","ids":{"openalex":"https://openalex.org/W1989257897","doi":"https://doi.org/10.1016/s0377-2217(97)00362-7","mag":"1989257897"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(97)00362-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00362-7","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/s0377-2217(97)00362-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021321550","display_name":"Monique Guignard","orcid":"https://orcid.org/0000-0003-4084-434X"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Monique Guignard","raw_affiliation_strings":["Department of OPIM, The Wharton School, University of Pennsylvania, 1300 Steinberg Hall-Dietrich Hall, Philadelphia, PA 19104-6366, USA"],"affiliations":[{"raw_affiliation_string":"Department of OPIM, The Wharton School, University of Pennsylvania, 1300 Steinberg Hall-Dietrich Hall, Philadelphia, PA 19104-6366, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018061947","display_name":"Choonho Ryu","orcid":null},"institutions":[{"id":"https://openalex.org/I94588446","display_name":"Hongik University","ror":"https://ror.org/00egdv862","country_code":"KR","type":"education","lineage":["https://openalex.org/I94588446"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Choonho Ryu","raw_affiliation_strings":["Department of Business Administration, Hong Ik University, 72-1 Sangsoo-dong Mapo-gu, Seoul 121-791, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Business Administration, Hong Ik University, 72-1 Sangsoo-dong Mapo-gu, Seoul 121-791, South Korea","institution_ids":["https://openalex.org/I94588446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020805618","display_name":"Kurt Spielberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kurt Spielberg","raw_affiliation_strings":["Independent Consultant and IBM, 2005 Market Street, Philadelphia, PA 19103, USA"],"affiliations":[{"raw_affiliation_string":"Independent Consultant and IBM, 2005 Market Street, Philadelphia, PA 19103, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021321550"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":1.3426,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.7597423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"111","issue":"3","first_page":"448","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12118","display_name":"Forest Biomass Utilization and Management","score":0.9585999846458435,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12118","display_name":"Forest Biomass Utilization and Management","score":0.9585999846458435,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9039000272750854,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7134854197502136},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7057368755340576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6164795160293579},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6015866994857788},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5672913193702698},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5655694007873535},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5175080299377441},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49951744079589844},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.49747994542121887},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.4900246858596802},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48637083172798157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4530177414417267},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4248877763748169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3824481964111328},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.33728647232055664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22631403803825378},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.18200290203094482},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11631488800048828},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08145570755004883}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7134854197502136},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7057368755340576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6164795160293579},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6015866994857788},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5672913193702698},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5655694007873535},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5175080299377441},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49951744079589844},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.49747994542121887},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.4900246858596802},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48637083172798157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4530177414417267},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4248877763748169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3824481964111328},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33728647232055664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22631403803825378},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.18200290203094482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11631488800048828},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08145570755004883},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(97)00362-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00362-7","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:111:y:1998:i:3:p:448-460","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00362-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1016/s0377-2217(97)00362-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00362-7","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2025061866","https://openalex.org/W3083382439"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2941986668","https://openalex.org/W2084616826","https://openalex.org/W1997215277","https://openalex.org/W1983294952","https://openalex.org/W1968202374","https://openalex.org/W2889871839","https://openalex.org/W2024753861","https://openalex.org/W2165085685","https://openalex.org/W2029446116"],"abstract_inverted_index":{"Integrated":[0],"timber":[1],"harvest":[2],"and":[3,55,82,93],"transportation":[4],"planning":[5],"problems":[6],"can":[7,37],"be":[8,26,38],"modeled":[9],"as":[10],"0-1":[11],"mixed":[12],"integer":[13],"programming":[14],"problems,":[15],"but":[16],"initial":[17],"computations":[18],"led":[19],"to":[20],"large":[21],"integrality":[22],"gaps":[23],"which":[24],"cannot":[25],"overcome":[27],"easily.":[28],"In":[29],"this":[30,35],"paper":[31],"we":[32],"show":[33],"how":[34],"situation":[36],"substantially":[39],"improved":[40],"by":[41],"a":[42,64],"combination":[43],"of":[44,49,53,58,66,72,77,79,87],"techniques,":[45],"such":[46],"as:":[47],"addition":[48],"logical":[50],"inequalities,":[51],"lifting":[52],"inequalities":[54],"careful":[56],"selection":[57],"Branch-and-Bound":[59,91],"branching":[60],"priorities":[61],"based":[62],"on":[63],"consideration":[65],"double-contraction.":[67],"We":[68],"compare":[69],"various":[70],"combinations":[71],"tightening":[73],"techniques":[74],"in":[75,89],"terms":[76],"number":[78,86],"(integer)":[80],"variables":[81],"constraints,":[83],"LP":[84],"bound,":[85],"nodes":[88],"the":[90],"tree":[92],"CPU":[94],"time.":[95]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}