The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transportation problem with nonlinear side constraints a branch and bound approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving transportation problems with nonlinear side constraints with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal algorithm for solving a capacitated network flow problem with additional linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basis exchange characterizations for the simplex son algorithm for LP/embedded networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Threaded Index Method For Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Constrained Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Method for the Fixed Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Branch-and-Bound Method for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 18:24, 4 June 2024

scientific article
Language Label Description Also known as
English
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
scientific article

    Statements

    The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (English)
    0 references
    0 references
    13 November 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    integer programming
    0 references
    transportation
    0 references
    branch-and-bound
    0 references
    logistics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references