Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems (Q852995): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036307851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 23:07, 24 June 2024

scientific article
Language Label Description Also known as
English
Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
scientific article

    Statements

    Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    branch and bound
    0 references
    forest planning
    0 references
    elastic constraints
    0 references
    constraint branching
    0 references
    0 references