Improving branch-and-cut performance by random sampling (Q266414): 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.1007/s12532-015-0096-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2270533177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming: Analyzing 12 Years of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the impact of primal heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using diversification, communication and parallelism to solve mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Erraticism in Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed processing algorithm for solving integer programs using a cluster of workstations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank

Latest revision as of 18:35, 11 July 2024

scientific article
Language Label Description Also known as
English
Improving branch-and-cut performance by random sampling
scientific article

    Statements

    Identifiers