Výsledky vyhledávání - "programming: integer"

  1. 1

    Order Assignment and Scheduling in a Supply Chain Autor Chen, Zhi-Long, Pundoor, Guruprasad

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.05.2006
    Vydáno v Operations research (01.05.2006)
    “…We consider the supply chain of a manufacturer who produces time-sensitive products that have a large variety, a short life cycle, and are sold in a very short…”
    Získat plný text
    Journal Article
  2. 2

    Global Optimality Conditions for Discrete and Nonconvex Optimization--With Applications to Lagrangian Heuristics and Column Generation Autor Larsson, Torbjorn, Patriksson, Michael

    ISSN: 0030-364X, 1526-5463, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.05.2006
    Vydáno v Operations research (01.05.2006)
    “…The well-known and established global optimality conditions based on the Lagrangian formulation of an optimization problem are consistent if and only if the…”
    Získat plný text
    Journal Article
  3. 3

    An Integer Optimization Approach to a Probabilistic Reserve Site Selection Problem Autor Haight, Robert G, Revelle, Charles S, Snyder, Stephanie A

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum INFORMS 01.09.2000
    Vydáno v Operations research (01.09.2000)
    “… The problem is often formulated to select the set of reserve sites that maximizes the number of species or ecological communities that are represented, subject to an upper bound on the number or area of selected sites…”
    Získat plný text
    Journal Article
  4. 4

    Flow Management to Optimize Retail Profits at Theme Parks Autor Rajaram, Kumar, Ahmadi, Reza

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum INFORMS 01.03.2003
    Vydáno v Operations research (01.03.2003)
    “…In many theme parks, stores are located within major attractions to sell related merchandise. Sales at such stores form a significant portion of theme park…”
    Získat plný text
    Journal Article
  5. 5

    An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem Autor Talbot, F. Brian, Patterson, James H

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum INFORMS 01.01.1984
    Vydáno v Management science (01.01.1984)
    “…In this paper, we describe an integer programming algorithm for assigning tasks on an assembly line to work stations in such a way that the number of work…”
    Získat plný text
    Journal Article
  6. 6

    R&D Project Selection and Manpower Allocation with Integer Nonlinear Goal Programming Autor Taylor, Bernard W., III, Moore, Laurence J, Clayton, Edward R

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum INFORMS 01.10.1982
    Vydáno v Management science (01.10.1982)
    “…A number of recent research efforts in the area of research and development planning have indicated the necessity that the R&D project selection process be…”
    Získat plný text
    Journal Article
  7. 7

    Technical Note--An Improved Dual Based Algorithm for the Generalized Assignment Problem Autor Guignard, Monique, Rosenwein, Moshe B

    ISSN: 0030-364X, 1526-5463
    Vydáno: INFORMS 01.08.1989
    Vydáno v Operations research (01.08.1989)
    “…The generalized assignment problem (GAP) determines the minimum cost assignment of n jobs to m agents such that each job is assigned to exactly one agent, subject to an agent's capacity…”
    Získat plný text
    Journal Article
  8. 8

    Note--Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems Autor Granot, Frieda

    ISSN: 0025-1909, 1526-5501
    Vydáno: INFORMS 01.07.1982
    Vydáno v Management science (01.07.1982)
    “…) problem of finding a 0-1 vector x that maximizes c T x subject to f ( x ) b where c , b 0 and f is an m -vector of polynomials with non-negative coefficients…”
    Získat plný text
    Journal Article
  9. 9

    Scheduling School Buses Autor Swersey, Arthur J, Ballard, Wilson

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum INFORMS 01.07.1984
    Vydáno v Management science (01.07.1984)
    “…In the scheduling situation considered here, we are given a set of routes, each associated with a particular school. A single bus is assigned to each route,…”
    Získat plný text
    Journal Article
  10. 10

    Maximization of Labor Productivity Through Optimal Rest-Break Schedules Autor Bechtold, Stephen E, Janaro, Ralph E, Sumners, De Witt L

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum, MD INFORMS 01.12.1984
    Vydáno v Management science (01.12.1984)
    “…This paper focuses upon the maximization of labor productivity through selection of the optimal number, duration, and placement of rest breaks. It is…”
    Získat plný text
    Journal Article
  11. 11

    School Timetabling--A Case in Large Binary Integer Linear Programming Autor Tripathy, Arabinda

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum, MD INFORMS 01.12.1984
    Vydáno v Management science (01.12.1984)
    “… We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program…”
    Získat plný text
    Journal Article
  12. 12

    Covering Relaxation for Positive 0-1 Polynomial Programs Autor Granot, Daniel, Granot, Frieda, Kallberg, Jerry

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum INFORMS 01.03.1979
    Vydáno v Management science (01.03.1979)
    “…Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph…”
    Získat plný text
    Journal Article
  13. 13

    A Survey of Methods for Pure Nonlinear Integer Programming Autor Cooper, Mary W

    ISSN: 0025-1909, 1526-5501
    Vydáno: Linthicum INFORMS 01.03.1981
    Vydáno v Management science (01.03.1981)
    “…The subject of this paper is a classification and discussion of algorithms for solution of nonlinear pure integer programming problems…”
    Získat plný text
    Journal Article
  14. 14

    Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows Autor Jepsen, Mads, Petersen, Bjorn, Spoorendonk, Simon, Pisinger, David

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.03.2008
    Vydáno v Operations research (01.03.2008)
    “…This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc…”
    Získat plný text
    Journal Article
  15. 15

    A case of cooperation in the European OR education Autor Miranda, João, Nagy, Mariana

    ISSN: 0304-3797, 1469-5898
    Vydáno: Abingdon Taylor & Francis 01.12.2011
    “… The module considers eight lecture hours in four sessions: (i) the introductory session, to focus on the basics of computational linear algebra, linear programming, integer programming, with computational support (Excel®); (ii…”
    Získat plný text
    Journal Article
  16. 16

    Two-Stage Fleet Assignment Model Considering Stochastic Passenger Demands Autor Sherali, Hanif D, Zhu, Xiaomei

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.03.2008
    Vydáno v Operations research (01.03.2008)
    “…An airline's fleet typically contains multiple aircraft families, each having a specific cockpit design and crew requirement. Each aircraft family contains…”
    Získat plný text
    Journal Article
  17. 17

    Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction Autor Pisinger, W. David, Rasmussen, Anders Bo, Sandvik, Rune

    ISSN: 1091-9856, 1526-5528, 1091-9856
    Vydáno: Linthicum INFORMS 22.03.2007
    Vydáno v INFORMS journal on computing (22.03.2007)
    “…The quadratic knapsack problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint…”
    Získat plný text
    Journal Article
  18. 18

    Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems Autor Granot, Frieda

    ISSN: 0025-1909, 1526-5501
    Vydáno: Hanover, MD., etc Institute of Management Sciences 01.07.1982
    Vydáno v Management science (01.07.1982)
    “…) problem of finding a 0-1 vector x that maximizes cTx subject to f(x) ≤ b where c, b ≥ 0 and f is an m-vector of polynomials with non-negative coefficients…”
    Získat plný text
    Journal Article
  19. 19

    R & D Project Selection and Manpower Allocation with Integer Nonlinear Goal Programming Autor Taylor, Bernard W., Moore, Laurence J., Clayton, Edward R.

    ISSN: 0025-1909, 1526-5501
    Vydáno: Hanover, MD., etc Institute of Management Sciences 01.10.1982
    Vydáno v Management science (01.10.1982)
    “…A number of recent research efforts in the area of research and development planning have indicated the necessity that the R & D project selection process be…”
    Získat plný text
    Journal Article
  20. 20

    On CVT Minimization in Single Machine Scheduling Autor Manna, D K

    ISBN: 9798496579858
    Vydáno: ProQuest Dissertations & Theses 01.01.1996
    “…1 SCHEDULING PROBLEM Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and…”
    Získat plný text
    Dissertation