Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2006.02.005 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4735941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming asymmetric into symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete anytime algorithm for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of linear-space search algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2006.02.005 / rank
 
Normal rank

Latest revision as of 18:23, 18 December 2024

scientific article
Language Label Description Also known as
English
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
scientific article

    Statements

    Cut-and-solve: An iterative search strategy for combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    search strategies
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    anytime algorithms
    0 references
    linear programming
    0 references
    traveling Salesman problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references