Journal: Computers & OR

Volume 35, Issue 5

1377 -- 1378John W. Chinneck. Editorial
1379 -- 1393Leon Lasdon, John C. Plummer. Multistart algorithms for seeking feasibility
1394 -- 1411Walid Ibrahim, John W. Chinneck. Improving solver success in reaching feasibility for sets of nonlinear constraints
1412 -- 1435Chandra Sekhar Pedamallu, Linet Özdamar, Martine Ceberio. Efficient interval partitioning - Local search collaboration for constraint satisfaction
1436 -- 1445Matteo Fischetti, Andrea Lodi. Repairing MIP infeasibility through local branching
1446 -- 1464Mustafa K. Atlihan, Linus Schrage. Generalized filtering algorithms for infeasibility analysis
1465 -- 1482Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale. A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
1483 -- 1493Jian Yang. Infeasibility resolution based on goal programming
1494 -- 1509Paula Amaral, Joaquim Júdice, Hanif D. Sherali. A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
1510 -- 1538Yu Xia, Farid Alizadeh. The Q method for second order cone programming
1539 -- 1545Dvir Shabtay. Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
1546 -- 1561Ardavan Asef-Vaziri, Nicholas G. Hall, Ronny George. The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
1562 -- 1575Marta Mesquita, Ana Paias. Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
1576 -- 1588Robert A. Russell, Wen-Chyuan Chiang, David Zepeda. Integrating multi-product production and distribution in newspaper logistics
1589 -- 1600Paolo Dell Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola. Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
1601 -- 1612Artyom G. Nahapetyan, Panos M. Pardalos. A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
1613 -- 1623M. T. Almeida, G. Schütz, F. D. Carvalho. Cell suppression problem: A genetic-based approach
1624 -- 1637Fuh-Hwa Franklin Liu, Hao Hsuan Peng. Ranking of units on the DEA frontier with common weights
1638 -- 1651Juan José Salazar González. Statistical confidentiality: Optimization techniques to protect tables
1652 -- 1659Chin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee. Single-machine group scheduling problems with deterioration consideration
1660 -- 1670Byeong-Seok Ahn, Kyung-Sam Park. Comparing methods for multiattribute decision making with ordinal weights
1671 -- 1683X. Q. Cai, J. Chen, Y. B. Xiao, X. L. Xu. Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline
1684 -- 1696Seong-Woo Choi, Yeong-Dae Kim. Minimizing makespan on an m-machine re-entrant flowshop
1697 -- 1712Yasmin A. Rios-Solis, Francis Sourd. Exponential neighborhood search for a parallel machine scheduling problem
1713 -- 1724Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib Metrane, François Soumis. Bi-dynamic constraint aggregation and subproblem reduction
1725 -- 1741Abdellah El-Fallahi, Christian Prins, Roberto Wolfler Calvo. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
1742 -- 1755Zhipeng Lü, Wenqi Huang. PERM for solving circle packing problem