An effective matheuristic for the capacitated total quantity discount problem (Q336744): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.07.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971331599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: a new heuristic framework for portfolio selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring greedy criteria for the dynamic traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for sourcing from multiple suppliers with alternative quantity discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concave cost supply problem. / 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: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proposal for a hybrid meta-strategy for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for procurement problems under a total quantity discount structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Multiple Item Ordering with Incremental Quantity Discounts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound-based local search method for the flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated total quantity discount problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling purchaser problem with budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for the travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu search strategies for the traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vendor selection criteria and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:42, 12 July 2024

scientific article
Language Label Description Also known as
English
An effective matheuristic for the capacitated total quantity discount problem
scientific article

    Statements

    An effective matheuristic for the capacitated total quantity discount problem (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    supplier selection
    0 references
    total quantity discount
    0 references
    matheuristic
    0 references
    ILP refinement
    0 references
    0 references
    0 references

    Identifiers