Global ETD Search

61	Polynomial time algorithms for linear and integer programming Chu, Chi-kwan. January 2000 (has links) Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 71-73).
62	Stream water quality management a stochastic mixed-integer programming model / Ali, Md. Kamar. January 2002 (has links) Thesis (Ph. D.)--West Virginia University, 2002. / Title from document title page. Document formatted into pages; contains xi, 158 p. : ill. (some col.), col. map. Vita. Includes abstract. Includes bibliographical references (p. 126-132).
63	Computational investigation of cutting techniques for integer programming / Puttapanom, Sutanit. January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 110-113). Also available on the Internet.
64	Computational investigation of cutting techniques for integer programming Puttapanom, Sutanit. January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 110-113). Also available on the Internet.
65	Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms Hunsaker, Braden K., January 2003 (has links) (PDF) Thesis (Ph. D.)--School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004. Directed by Ellis L. Johnson. / Vita. Includes bibliographical references (leaves 172-174).
66	A compressive sensing approach to solving nonograms Lopez, Oscar Fabian 12 December 2013 (has links) A nonogram is a logic puzzle where one shades certain cells of a 2D grid to reveal a hidden image. One uses the sequences of numbers on the left and the top of the grid to figure out how many and which cells to shade. We propose a new technique to solve a nonogram using compressive sensing. Our method avoids (1) partial fill-ins, (2) heuristics, and (3) over-complication, and only requires that we solve a binary integer programming problem. / text Nonogram Compressive sensing Binary integer programming
67	Polynomial time algorithms for linear and integer programming 朱紫君, Chu, Chi-kwan. January 2000 (has links) published_or_final_version / Mathematics / Master / Master of Philosophy Algorithms. Polynomials. Linear programming. Integer programming.
68	A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem White, John Lincoln January 2010 (has links) The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities for the Asymmetric TSP can be easily extended to the TDTSP, but the added time information can be used to strengthen these inequalities. We look at extending the Lifted Cycle Inequalities, a large family of inequalities for the ATSP. We define a new inequality, the Extended Cycle (X-cycle) Inequality, based on cycles in the graph. We extend the results of Balas and Fischetti for Lifted Cycle Inequalities to define Lifted X-cycle Inequalities. We show that the Lifted X-cycle Inequalities include some inequalities which define facets of the submissive of the TDTS Polytope. Integer Programming Traveling Salesman Problem Combinatorics and Optimization
69	Maximizing a submodular function by integer programming : a polyhedral approach Lee, Heesang 05 1900 (has links) No description available. Materials handling Order picking systems Integer programming
70	Integer programming approaches to capacitated concave cost production planning problems Ramsay, Thomas Eugene 05 1900 (has links) No description available. Production planning Integer programming Network analysis (Planning)

Search results