Publication date
January 1978
DOIAbstract
Ph.D.Operations researchUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/178396/2/7822958.pd
DOIPh.D.Operations researchUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/178396/2/7822958.pd
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools ...
International audienceIn this work we propose an efficient branch-and-bound (B&B) algorithm for the ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4088/5/bam0429.0001.001.pdfhttp://deepblue.lib.umich...
PhDOperations researchUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://dee...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathemat...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX176676 / BLDSC - British Library D...
The Permutation Flowshop problem is one of the most well-known problems in the field of scheduling a...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
International audienceMany real-world problems in different industrial and economic fields are permu...
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling...
The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling...
Many important problems in operations research, artificial intelligence, combinatorial algorithms, a...
International audienceSparse optimization focuses on finding a solution to least-squares problems wi...
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools ...
International audienceIn this work we propose an efficient branch-and-bound (B&B) algorithm for the ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4088/5/bam0429.0001.001.pdfhttp://deepblue.lib.umich...
PhDOperations researchUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://dee...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathemat...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX176676 / BLDSC - British Library D...
The Permutation Flowshop problem is one of the most well-known problems in the field of scheduling a...
The Maximum Permutation Code Problem (MPCP) is a well-known combinatorial optimization problem in co...
International audienceMany real-world problems in different industrial and economic fields are permu...
The m-machine permutation flowshop problem with the total flow-time objective is a common scheduling...
The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling...
Many important problems in operations research, artificial intelligence, combinatorial algorithms, a...
International audienceSparse optimization focuses on finding a solution to least-squares problems wi...
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools ...
International audienceIn this work we propose an efficient branch-and-bound (B&B) algorithm for the ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4088/5/bam0429.0001.001.pdfhttp://deepblue.lib.umich...
Add to ORKG