메뉴 건너뛰기




Volumn 16, Issue 5, 2010, Pages 715-722

ZI round, a MIP rounding heuristic

Author keywords

Heuristic; Mixed integer program; Rounding

Indexed keywords

COMMERCIAL CODES; CREW SCHEDULING; FEASIBLE SOLUTION; HEURISTIC; LP RELAXATION; MIXED-INTEGER PROGRAMS; ROUNDING; ROUNDING HEURISTICS; SET COVERINGS; TEST SETS;

EID: 79951773096     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-009-9114-6     Document Type: Article
Times cited : (15)

References (11)
  • 1
    • 62249219958 scopus 로고    scopus 로고
    • Ph.D. thesis. University of Berlin (July), Accessed 12 October 2008
    • Achterberg, T.: Constraint integer programming. Ph.D. thesis. University of Berlin (July 2007). http://opus.kobv.de/tuberlin/volltexte/2007/1611/. Accessed 12 October 2008
    • (2007) Constraint Integer Programming
    • Achterberg, T.1
  • 2
    • 33646096451 scopus 로고    scopus 로고
    • MIPLIB 2003
    • Accessed 12 October 2008
    • Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 1-12 (2006). http://miplib.zib.de/. Accessed 12 October 2008
    • (2006) Oper. Res. Lett. , vol.34 , pp. 1-12
    • Achterberg, T.1    Koch, T.2    Martin, A.3
  • 3
    • 79951771589 scopus 로고    scopus 로고
    • Masters Thesis. University of Berlin (September), Accessed 12 October 2008
    • Berthold, T.: Primal heuristics for mixed integer programs. Masters Thesis. University of Berlin (September 2006). http://www.zib.de/groetschel/ students/Diplom-Berthold.pdf. Accessed 12 October 2008
    • (2006) Primal Heuristics for Mixed Integer Programs
    • Berthold, T.1
  • 4
    • 79951768660 scopus 로고    scopus 로고
    • Heuristics of the branch-cut-and-price-framework SCIP
    • March 20
    • Berthold, T.: Heuristics of the branch-cut-and-price-framework SCIP. In: Operations Research Proceedings, March 20, pp. 31-36 (2008)
    • (2008) Operations Research Proceedings , pp. 31-36
    • Berthold, T.1
  • 8
    • 0002296888 scopus 로고
    • Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
    • Fulkerson, D., Nemhauser, G., Trotter, L. Jr.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Program. Study 2, 72-81 (1974)
    • (1974) Math. Program. Study , vol.2 , pp. 72-81
    • Fulkerson, D.1    Nemhauser, G.2    Trotter Jr., L.3
  • 10
    • 79951773860 scopus 로고    scopus 로고
    • Recent updates to our benchmarks
    • Boston, MA, May 10-13,Accessed 12 October, 2008
    • Mittelmann, H.: Recent updates to our benchmarks. In: SIAM Conference on Optimization, Boston, MA, May 10-13 (2008b). http://plato.asu.edu/talks/ op08scip.pdf. Accessed 12 October, 2008
    • (2008) SIAM Conference on Optimization
    • Mittelmann, H.1
  • 11
    • 79951773593 scopus 로고    scopus 로고
    • SCIP, Accessed 12 October
    • SCIP: http://scip.zib.de/. Accessed 12 October 2008
    • (2008)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.