Bounding, filtering and diversification in CP-based local branching (Q519096): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10732-011-9190-2 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6700349 / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint programming
Property / zbMATH Keywords: constraint programming / rank
 
Normal rank
Property / zbMATH Keywords
 
local search
Property / zbMATH Keywords: local search / rank
 
Normal rank
Property / zbMATH Keywords
 
cost-based filtering
Property / zbMATH Keywords: cost-based filtering / rank
 
Normal rank
Property / zbMATH Keywords
 
additive bounding
Property / zbMATH Keywords: additive bounding / rank
 
Normal rank
Property / zbMATH Keywords
 
diversification
Property / zbMATH Keywords: diversification / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman problem with time windows
Property / zbMATH Keywords: traveling salesman problem with time windows / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COMET / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPTW / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-011-9190-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151566886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization-oriented global constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Exact Algorithm for the TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: CP-Based Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint and integer programming. Toward a unified methodology. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint programming framework for local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-based arc consistency for global cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint programming based Lagrangian relaxation for the automatic recording problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Programming and Local Search Hybrids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Constraint-Based Local Search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10732-011-9190-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:14, 9 December 2024

scientific article
Language Label Description Also known as
English
Bounding, filtering and diversification in CP-based local branching
scientific article

    Statements

    Bounding, filtering and diversification in CP-based local branching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    constraint programming
    0 references
    local search
    0 references
    cost-based filtering
    0 references
    additive bounding
    0 references
    diversification
    0 references
    traveling salesman problem with time windows
    0 references
    0 references
    0 references

    Identifiers