Fischetti M., Salazar Gonzalez J.J., and Toth P. Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing, 10(2):133--148, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Branch-and-Cut Algorithm for the Plant-Cycle Location.. - Labbé, Martín, González (2003) Self-citation (Salazar) (Correct)
....that a customer i 2 I cannot be assigned to a plant j 2 J if j is not open. Constraints (13) dominate Constraints (3) when q j jIj, i.e. when solving an uncapacitated PCLP instance. Another useful family of constraints, related to the path inequalities proposed in Fischetti, Salazar and Toth [6] and to the chain barrier constraints presented in Laporte, Nobert and Arpin [11] is the following. For each Q J , fi; i g I and P : f[i; i 1 ] i 1 ; i 2 ] i k ; i ]g a path from i to i , the inequality x(P ) j2Q j = 2Q j jP j 1; 14) is valid for PCLP. ....
....constraint (15) for i and i . Therefore, again the separation problem can be solved by performing a max ow computation for each pair of customers. Separation of 2 matching constraints (16) To separate constraints (16) we adapted the classical heuristic proposed in Fischetti, Salazar and Toth [6], and brie y described as follows. Let us consider the support graph G ) of the current solution, i.e. the subgraph of G where E : fe 2 E : x e 0g. When removing the edges e with biggest value x e from E , the remaining connected components are good candidates for being the ....
M. Fischetti, J.J. Salazar, P. Toth. \Solving the Orienteering Problem through Branch-and-Cut", INFORMS Journal on Computing 10 (1998) 133-148.
The Median Cycle Problem - Labbé, Laporte, Martín, González (1999) (3 citations) Self-citation (Salazar) (Correct)
No context found.
M. Fischetti, J.J. Salazar, P. Toth, "Solving the Orienteering Problem through Branch-and-Cut", INFORMS Journal on Computing 10 (1998) 133--148.
The Median Cycle Problem - Labbé, Laporte, Martín, González (2001) (3 citations) Self-citation (Salazar) (Correct)
No context found.
M. FISCHETTI, J.J. SALAZAR, P. TOTH. 1998. Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing 10, 133-148.
A Branch-and-Cut Algorithm for the Undirected.. - Laporte.. Self-citation (Salazar) (Correct)
No context found.
M. Fischetti, J.J. Salazar, P. Toth, \Solving the Orienteering Problem through Branch-andCut ", INFORMS Journal on Computing 10 (1998) 133-148.
The Median Cycle Problem - Labbé, Laporte, Martín, González (1999) (3 citations) Self-citation (Salazar) (Correct)
No context found.
M. Fischetti, J.J. Salazar, P. Toth, \Solving the Orienteering Problem through Branch-and-Cut", INFORMS Journal on Computing 10 (1998) 133-148.
Traveling Salesman Problems With Profits: An Overview - Feillet, Dejax, Gendreau (2001) (Correct)
No context found.
Fischetti M., Salazar Gonzalez J.J., and Toth P. Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing, 10(2):133--148, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC