Výsledky vyhľadávania - (("programming: integer algorithms") OR ("programming: interior algorithms"))

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

“…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ískať plný text

A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem Autor Hadjar, Ahmed, Marcotte, Odile, Soumis, Francois

“…We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation,…”
Získať plný text

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem Autor Holmberg, Kaj, Yuan, Di

“…The capacitated network design problem is a multicommodity minimal cost network flow problem with fixed charges on the arcs and is well known to be NP-hard…”
Získať plný text

Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems Autor den Boef, Edgar, Korst, Jan, Martello, Silvano, Pisinger, David, Vigo, Daniele

“…In the three-dimensional bin packing problem the task is to orthogonally pack a given set of rectangular items into a minimum number of three-dimensional…”
Získať plný text

The Reversal Median Problem Autor Caprara, Alberto

“…In this paper, we study the Reversal Median Problem (RMP), which arises in computational biology as a basic model for the reconstruction of evolutionary trees…”
Získať plný text

An Analysis of Pediatric Vaccine Formulary Selection Problems Autor Hall, Shane N, Jacobson, Sheldon H, Sewell, Edward C

“…Vaccination against infectious disease is hailed as one of the great achievements in public health. However, the United States Recommended Childhood…”
Získať plný text

Solving Beam-Angle Selection and Dose Optimization Simultaneously via High-Throughput Computing Autor Zhang, Hao Howard, Shi, Leyuan, Meyer, Robert, Nazareth, Daryl, D'Souza, Warren

“…We provide a framework for integrating two stages of radiation treatment planning (RTP): beam-angle selection (BAS) and dose optimization (DO). The framework…”
Získať plný text

Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem Autor Margot, FranCois, Queyranne, Maurice, Wang, Yaoguang

“…We present an in-depth theoretical, algorithmic, and computational study of a linear programming (LP) relaxation to the precedence constrained single-machine…”
Získať plný text

Efficient Algorithms for the Inverse Spanning-Tree Problem Autor Hochbaum, Dorit S

“…The inverse spanning-tree problem is to modify edge weights in a graph so that a given tree T is a minimum spanning tree. The objective is to minimize the cost…”
Získať plný text

Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures Autor Hall, Nicholas G, Posner, Marc E

“…The operations research literature contains numerous studies on the design and application of optimization and heuristic solution procedures. These studies…”
Získať plný text

A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness Autor Wu, S David, Eui-Seok Byeon, Storer, Robert H

“…The weighted tardiness job-shop scheduling problem is studied, with the presence of random shop disturbances being taken into consideration. A basic thesis of…”
Získať plný text

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set Autor Feo, Thomas A, Resende, Mauricio G. C, Smith, Stuart H

“…An efficient randomized heuristic for a maximum independent set is presented. The procedure is tested on randomly generated graphs having from 400 to 3,500…”
Získať plný text

Branch and Bound Experiments in Convex Nonlinear Integer Programming Autor Gupta, Omprakash K, Ravindran, A

“…The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper…”
Získať plný text

An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem Autor Martello, Silvano, Toth, Paolo

“…We consider a knapsack problem in which each item has two types of weight and the container has two types of capacity. We discuss the surrogate, Lagrangian,…”
Získať plný text

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

“…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ískať plný text

Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach Autor Denizel, Meltem

“…This paper addresses the parts-grouping problem that arises in automated manufacturing environments where appropriate cutting tools must be loaded on Computer…”
Získať plný text

An Oil Pipeline Design Problem Autor Brimberg, Jack, Hansen, Pierre, Lin, Keh-Wei, Mladenovic, Nenad, Breton, MichEle

“…We consider a given set of offshore platforms and onshore wells producing known (or estimated) amounts of oil to be connected to a port. Connections may take…”
Získať plný text

The Co-Printing Problem: A Packing Problem with a Color Constraint Autor Peeters, Marc, Degraeve, Zeger

“…The co-printing problem is a new variant of the bin-packing problem. It finds its origin in the printing of Tetra-bricks in the beverage industry. Combining…”
Získať plný text

A Comparison of Formulations for the Single-Airport Ground-Holding Problem with Banking Constraints Autor Hoffman, Robert, Ball, Michael O

“…Both the single-airport ground-holding problem (GH) and the multi-airport ground-holding problem can be extended by the addition of banking constraints to…”
Získať plný text

A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem Autor Baybars, Ilker

“…In this survey paper we discuss the development of the simple assembly line balancing problem (SALBP); modifications and generalizations over time; present…”
Získať plný text