[go: up one dir, main page]

Groenevelt, 1985 - Google Patents

Resource allocation problems with decreasing marginal returns to scale

Groenevelt, 1985

Document ID
364796849230973672
Author
Groenevelt H
Publication year

External Links

Snippet

We consider resource allocation problems with concave objectives and a polymatroid feasible region, a special class of polyhedra. This class of problems has many applications, eg in marketing, advertising, capital budgetting, production management, portfolio selection …
Continue reading at search.proquest.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063112—Skill-based matching of a person or a group to a task
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • G06Q10/105—Human resources
    • G06Q10/1053—Employment or hiring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G06Q30/0202—Market predictions or demand forecasting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30017—Multimedia data retrieval; Retrieval of more than one type of audiovisual media
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity

Similar Documents

Publication Publication Date Title
Alonso-Mora et al. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Sungur et al. A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty
Berbotto et al. A randomized granular tabu search heuristic for the split delivery vehicle routing problem
Tóth et al. An efficient solution approach for real-world driver scheduling problems in urban bus transportation
Ferrucci Pro-active dynamic vehicle routing: real-time control and request-forecasting approaches to improve customer service
Mencía et al. Evolutionary one-machine scheduling in the context of electric vehicles charging
Ge et al. Revisiting the richness of integrated vehicle and crew scheduling
Akbay et al. A self-adaptive variant of CMSA: application to the minimum positive influence dominating set problem
Athanasopoulos et al. Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
Karlsson et al. Strengthening of feasibility cuts in logic-based Benders decomposition
Kraiczy et al. An adaptive and verifiably proportional method for participatory budgeting
Legrain et al. A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price
Groenevelt Resource allocation problems with decreasing marginal returns to scale
Arrojo Communication Sciences as Sciences of the Artificial: The Analysis of the Digital Terrestrial Television
Kiermaier et al. Flexible cyclic rostering in the service industry
Kristiansen et al. The consultation timetabling problem at danish high schools
Billing et al. Fair task allocation problem
Amato et al. Equitative Algorithms for Legal Conflict Resolution
Di Lorenzo et al. Ten years of routist: Vehicle routing lessons learned from practice
Malaguti et al. Algorithms and complexity results for the 0–1 knapsack problem with group fairness
Heeger et al. Fair Repetitive Interval Scheduling
Zebua et al. Government Policy Analysis on Online Transportation Services
Gebrealif et al. Architecture for orchestrating containers in cloud federations
Fridman et al. Fixed interval scheduling with third‐party machines
Wikarek et al. A data-driven approach to modeling and solving academic teachers’ competences configuration problem