The biobjective travelling purchaser problem (Q1885751): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Juan-José Salazar-González / rank
Normal rank
 
Property / author
 
Property / author: Juan-José Salazar-González / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / 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.ejor.2003.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170849295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing many jobs on a multi-purpose facility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ABACUS -- a branch-and-cut system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for the travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved solutions for the traveling purchaser problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the two-criterion large-scale travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:10, 7 June 2024

scientific article
Language Label Description Also known as
English
The biobjective travelling purchaser problem
scientific article

    Statements

    The biobjective travelling purchaser problem (English)
    0 references
    12 November 2004
    0 references
    Combinatorial optimization
    0 references
    Multiple criteria analysis
    0 references
    Travelling salesman
    0 references

    Identifiers