01' MILP (branch & bound) [IP_Wolsey95].Pdf, basic exa. (11 pp, 3 Mb), Solver IP_Wolsey95.xlsx, IP_Wolsey95.lp, Wols95.ltx, Wols95ltx.zip & tree, Wols95.lpp • Gurobi MIP basics • MILP: nomenclatura portuguesa.pdf

02' [EiseltSandblom] B&B.Pdf p 211 (4 pp, 3 Mb); see Fig.s I.27, I.28, I.29.
Strategies: depth-first, breadth-first, (adopted →) best-bound-first + "most fractional" (Sec. 6.2.2, p 217). Soln p 211 .xlsx, .ltx, tree.pdf (p 211).

03' [Bron.] prb6.2.Pdf (1 Mb) and prb6.4 (←prb1.6), Bron62.ltx, Bron62ltx.zip (relax.).

04' Wiesemann IP_Wiesemann.pdf (380 kb), IP_Wiese.lp, IP_Wiese_ltx.zip (tree).

05' [Sultan] p395ff.Pdf, p400.xls (count iterations !), p400soln.zip • [EckerKup]prb..Pdf (node 7 wrong ? .xlsx), EckerKup.ltx, tree.Pdf

07' • Binary variables Knapsack problem: [Bron.] KnapsackPr4e5.pdf: KnapsPr4.ltx; KnapsPr5.ltx, 5.lpp, 5.pdf

08' • Transformation using 0-1 var.s: Chen et al.'s p. 69 ff.pdf (book). Summary: noteChenEtAl.pdf.

09' • Beasley: 7 prbs., IP_Beasley_pdf.zip, solved or illustrative → page…

10' • Wikipedia: Travelling salesman problem (TSP) • 1992EJOR_Laporte.pdf, an overview • (CD) My TSP_prototype.pdf

11' • %, as AP: [Bron.] prb9.6.Pdf (1 Mb) (prb9.6&18.xls, tree18.pdf ?)

12' • TSP as AP relaxation: (Parviainen, LUT.fi) #tsp5_2.pdf (=), LUTtspltx.zip, LUTtspap.xlsx (AP relaxation: 2 or more subproblems !) • TSP_Raffensperger.ppsx (sl. 1–7) • Covering (visiting) TSP_data.xlsx tray points (Carpaneto....)

* Revisions • Transportation problem.xlsx, with tolls, models.pdf • Simulation of distance.xlsx in a circle (COUNTIF) • "Julia".pdf.

13' •  Project selection question, solution, answer.xlsx, =.ltx • Vandenberghe ilp.pdf (facility location, B&B), =.xlsx =.ltx (& see log)

14' • How to snatch into Excel • How to pilfer a 'ppsx' ? (save 'ppsx', start PP, open 'ppsx', etc.).

15' • LP w/ bin. var., fix cost.mp4 • UTemple: IntegerProg.pptx (pptx or ppsx; 103 sl.: exa.s 45 bin 49 57 59 62 71 fixCh 87)

• IMSL lib.s • MILP search (Mixed Integer Linear Programming) • NAG, Fortran library • NEOS (Network-Enabled Optimization Sys.) — ANL (Argonne Nat'l Lab.), MCS (Maths. & Computer Sci.) • TSP, travelling salesman problem • WolfrMW, Wolfram MathWorld (Mathematica)

• Dictionaries, etc....: optimum (n./adj.), greatest degree / best, most advantageous ← L., neut. s. of optimus (used as superl. of bonus, "good") ← ops, "power" (related to opt ← Fr. opter) • solution (soln.), an action or process of solving a problem; answer to a problem; specifically, a set of values of the variables that satisfies an equation • to prune, to cut off parts (eg., tree branches) for better shape, more fruits (podar .pt .es, élaguer .fr, potare .it, stutzen .de) • to fathom, to measure by a sounding line (to evaluate)

• Bibliography  H&L [Hillier & Lieberman, 2005]; BronNaad [Bronson & Naadimuthu, 1997]; Chen et al. [Chen et al., 2010 (book !)]
EckerKup [Ecker & Kupferschmid, 1988]; Sultan [Sultan, 1993] • Jacobs & Chase, 2010 (preface.pdf), "Operations and supply management", 2.nd ed., McGraw-Hill Irwin • Mathematica, MathWorld, Integrator, Functions Site • NIST/SEMATECH e-Handbook of Statistical Methods • ASQ