Integer Programming
Discrete mathematics and its applications · 2006
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Integer programming”
Discrete mathematics and its applications · 2006
Cited by 0
SpringerReference · 2011
Cited by 8
2005
New Heuristics and Adaptive Memory Procedures for Boolean Optimization Problems, Lars M. Hvattum, Arne Lokketangen, and Fred Glover Convergent Lagrangian Methods for Separable Nonlinear Integer Programming: Objective Level-Cut and Domain-Cut Methods, Duan Li, Xiaoling Sun, and Jun Wang The Generalized Assignment Problem, Robert M. Nauss Decomposition in Integer Linear Programming, Ted K. Ralphs and Matthew V. Galati Airline Scheduling Models and Solution Algorithms for the Temporary Closure of Airports, Shangyao Yan and Chung-Gee Lin Determining an Optimal Fleet Mix and Schedules: Part I - Single Source and Destination, Hanif D. Sherali and Salem M. Al-Yakoob Determining an Optimal Fleet Mix and Schedules: Part II - Multiple Sources and Destinations, and the Option of Leasing Transshipment Depots, Hanif D. Sherali and Salem M. Al-Yakoob An Integer Programming Model for the Optimization of Data Cycle Maps, David Panton, Maria John, and Andrew Mason Application of Column-Generation Techniques to Retail Assortment Planning, Govind P. Daruka and Udatta S. Palekar Noncommercial Software for Mixed-Integer Linear Programming, Jeff T. Linderoth and Ted K. Ralphs
Cited by 121
Mathematics in Science and Engineering/Mathematics in science and engineering · 1971
Cited by 1
Joseph L. Awange, Béla Paláncz, Robert H. Lewis et al. · 2018
Cited by 0
Xin‐She Yang · 2018
Integer programming (IP) is a special class of combinatorial optimization problems, which tends to be difficult to solve. The variables in linear programming (LP) are non-negative real numbers, but in many real-world applications, variables can only take integer values such as the number of staff or number of products. This chapter shows that the LP relaxation method can obtain the globally optimal solution. Different approaches are used to tackle integer programs in general. For this purpose, there are a few methods including the branch and bound, cut and bound, cutting planes, heuristic methods, and others. The chapter introduces the basic “branch and bound” method. The branch and bound method can be applied to solve such mixed integer programming (MIP) problems without any modification. There are a diverse range of applications of LP, from transport problem to scheduling.
Cited by 0
Mc S · 1972
Cited by 0
Anderson Patricia S · 1971
The Council of Chief State School Officers has_rasised some issues pertinent to th- implementation of a national project_to collect statistical indicators ot academic achievement and to compare them across states. The United States_Department of Education shares this concern, with an emphasis_on sampling_schools for a school level analysis which may be aggregated to the state level. Three issues raised_by_the:Chiefs include the identification of subject matter domains for assessment, the scale for analysis and reporting of results, and the administration and standardization of testing across the states. Potential problems with national testing include the following: (1) redirection of state or local curriculum_goals; (2) high costs of a better method of cross-state comparisons than the current Wall Chart; (31 separating the effects_of student differences from curriculum or_teaching effects; (4) difficulty in making useful conclusions from_long-term testing; (5) conflict between state and local data_indicators; (6) selection of a model which does not restrict data collection and analysis; and (7) practical implementation problems. Testing programs in five Northwestern states
Cited by 0
L. S. Srinath · 1982
Cited by 0
Ulrich Faigle, Walter Kern, Georg Still · Kluwer texts in the mathematical sciences · 2002
Cited by 1
Richard K. Martin · 1999
Cited by 2
Joe F. Wampler, Stephen E. Newman · College Mathematics Journal · 1996
Click to increase image sizeClick to decrease image size Additional informationNotes on contributorsJoe F. WamplerJoe Wampler earned his A.B. and M.A. degrees from the University of Kansas at Lawrence, and the Ph.D. degree from the University of Nebraska at Lincoln. He taught mathematics at Nebraska Wesleyan University in Lincoln from 1954 until his retirement in 1992. His mathematical interests have been in number theory and statistics. He enjoys big band music of the ′30s and ′40s as well as travel, both domestic and foreign.Stephen E. NewmanSteve Newman received his Ph.D. from the University of Utah in 1968. He is currently a professor of mathematics at Northern Kentucky University, where he has been happily employed for nearly a quarter of a century. His interests include teaching, for which he is generously paid, and jogging.
Cited by 0
Guerra Roberto S · 1972
Of the more than two, million seasonal farmworktrs the,United States, nearly half are between the agei of 14 and 20 years. Although much has been done recently to meet some, of the special needs of these migrant ioutho they are still confronted'vith inadequate educational and training opportunities and limited career aspirations. In the forefront of what has been done:is career education, a widely discusSed but little understood concept Among educators and public alike. By adapting the concepts of-.career education to the special and unique circumstances-of the migrant ° tarmvorker, career education can have a positive impact on the educational process of the migrant child. This, paper focuses on the philosdphical and process Assumptions of careeroArducation and applies.them to the special situation of migrant childfen. Career education is discussed as a: (1) means of 'Strengthening the relationship bltween the school and work, (2) means of easing the transitio between school and Work when the time comes, and (3) vehicle w ich, 'will give migrant youth the opportunity to choose among alternative social and occupational lifestyles. (NQ) r I
Cited by 0
Martin H. Weik · 2000
Cited by 0
2005
Cited by 0
Bernard Kolman, Robert E. Beck · Elsevier eBooks · 1995
Cited by 9
Egon Balas · The New Palgrave Dictionary of Economics · 1987
Integer programming is the youngest branch of mathematical programming: its development started in the late 1950s. A (linear or nonlinear) integer program is a linear or nonlinear program whose variables are constrained to be integer. We will consider here only the linear case, although there exist extensions of the techniques to be discussed to nonlinear integer programming.
Cited by 0
Asoke Kumar Bhunia, Laxminarayan Sahoo, Ali Akbar Shaikh · Springer optimization and its applications · 2019
Cited by 0
H. A. Eiselt, Carl-Louis Sandblom · Springer texts in business and economics · 2012
Cited by 0
Leo Liberti · 2006
A short introduction to Integer Programming (IP). Problems leading to IP models. Some mod-elling tricks and reformulations. Geometry of linear IP. TUM matrices. Brief notes on polyhedral
Cited by 0