Search Results - "programming: integer algorithms"

The Demand-Matching Problem

Authors: Shepherd, F. B. Vetta, A.

Source: Mathematics of Operations Research, 2007 Aug 01. 32(3), 563-578.

Access URL: https://www.jstor.org/stable/25151810

Boundedness Theorems for the Relaxation Method

Authors: Amaldi, Edoardo Hauser, Raphael

Source: Mathematics of Operations Research, 2005 Nov 01. 30(4), 939-955.

Access URL: https://www.jstor.org/stable/25151695

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Authors: Fisher, Marshall L.

Source: Management Science, 2004 Dec 01. 50(12), 1861-1871.

Access URL: https://www.jstor.org/stable/30046157

Branch and Bound Experiments in Convex Nonlinear Integer Programming

Authors: Gupta, Omprakash K. Ravindran, A.

Source: Management Science, 1985 Dec 01. 31(12), 1533-1546.

Access URL: https://www.jstor.org/stable/2631793

A Dual-Based Procedure for Dynamic Facility Location

Authors: Van Roy, Tony J. Erlenkotter, Donald

Source: Management Science, 1982 Oct 01. 28(10), 1091-1105.

Access URL: https://www.jstor.org/stable/2630939

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Authors: Fisher, Marshall L.

Source: Management Science, 1981 Jan 01. 27(1), 1-18.

Access URL: https://www.jstor.org/stable/2631139

An Oil Pipeline Design Problem

Authors: Brimberg, J Hansen, P Lih, KW et al.

Source: Operations Research. 51:228-239

Subject Terms: algorithms: Interactive branch-and-bound with valid inequalities, 0211 other engineering and technologies, Oil pipeline network design [Industries, petroleum/natural gas], Design problem-formulation and analysis [Networks/graphs, applications], 02 engineering and technology, Interactive branch-and-bound with valid inequalities [Programming, integer, algorithms], petroleum/natural gas: Oil pipeline network design, integer, applications: Design problem-formulation and analysis, Programming, 0202 electrical engineering, electronic engineering, information engineering, Industries, Networks/graphs

Access URL: http://bura.brunel.ac.uk/bitstream/2438/6680/2/Fulltext.pdf
http://bura.brunel.ac.uk/handle/2438/6680

Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity

Authors: Pioro, Michal Fouquet, Yoann Nace, Dritan et al.

Contributors: Pioro, Michal Fouquet, Yoann Nace, Dritan et al.

Source: ISSN: 0030-364X.

Subject Terms: robust optimization, multiple partial link failures, mixed-integer programming, multicommodity flows, path generation, survivable network design, and Networks, Information, programming: integer: algorithms: Benders/decomposition Area of review: Games, robust optimization Subject classifications: networks/graphs: multicommodity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Availability: https://hal.science/hal-01298600
https://hal.science/hal-01298600v1/document
https://hal.science/hal-01298600v1/file/main-jan-12-2016.pdf
https://doi.org/10.1287/opre.2016.1486

Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope: Single-facility resource allocation under capacity-based economies and diseconomies of scope

Authors: Joseph B. Mazzola Robert H. Schantz

Source: Management Science. 41:669-689

Subject Terms: optimal allocation of a resource, 0502 economics and business, 05 social sciences, single-facility production environment, 0211 other engineering and technologies, production/scheduling, resource allocation, economies of scope, programming, integer, algorithms, heuristics, 0--1 knapsack problem, branch-and-bound, Integer programming, tabu-search heuristics, 02 engineering and technology, Production models, 0-1 knapsack problem, 12. Responsible consumption

File Description: application/xml

Access URL: https://zbmath.org/829740
https://doi.org/10.1287/mnsc.41.4.669
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.41.4.669
https://ideas.repec.org/a/inm/ormnsc/v41y1995i4p669-689.html
https://www.jstor.org/stable/2632887
https://econpapers.repec.org/article/inmormnsc/v_3a41_3ay_3a1995_3ai_3a4_3ap_3a669-689.htm

Tabu Search: A Tutorial

Authors: Glover, Fred

Source: Interfaces, 1990 Jul 01. 20(4), 74-94.

Access URL: https://www.jstor.org/stable/25061372

Single-Facility Resource Allocation under Capacity-Based Economies and Diseconomies of Scope

Authors: Mazzola, Joseph B. Schantz, Robert H.

Source: Management Science, 1995 Apr 01. 41(4), 669-689.

Access URL: https://www.jstor.org/stable/2632887

Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

Authors: Coffman,, E. G. Lueker, G. S.

Source: Management Science, 1988 Mar 01. 34(3), 266-290.

Access URL: https://www.jstor.org/stable/2632045

An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems -- A Parametric Approach

Authors: Lee, Jae Sik Guignard, Monique

Source: Management Science, 1988 Mar 01. 34(3), 402-410.

Access URL: https://www.jstor.org/stable/2632052

Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation

Authors: Cabot, A. Victor Erenguc, S. Selcuk

Source: Management Science, 1986 Jul 01. 32(7), 856-869.

Access URL: https://www.jstor.org/stable/2631766

Heuristics for Multilevel Lot-Sizing with a Bottleneck

Authors: Billington, Peter J. McClain, John O. Thomas, L. Joseph

Source: Management Science, 1986 Aug 01. 32(8), 989-1006.

Access URL: https://www.jstor.org/stable/2631663

A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem

Authors: Baybars, İlker

Source: Management Science, 1986 Aug 01. 32(8), 909-932.

Access URL: https://www.jstor.org/stable/2631657

Minimizing Mean Squared Deviation of Completion Times about a Common Due Date

Authors: Bagchi, Uttarayan Sullivan, Robert S. Chang, Yih-Long

Source: Management Science, 1987 Jul 01. 33(7), 894-906.

Access URL: https://www.jstor.org/stable/2632140

An Interactive Decomposable Heuristic for Project Selection

Authors: Mandakovic, Tomislav Souder, William E.

Source: Management Science, 1985 Oct 01. 31(10), 1257-1271.

Access URL: https://www.jstor.org/stable/2631715

On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

Authors: Gupta, Sushil K. Sen, Tapan

Source: Management Science, 1984 May 01. 30(5), 644-647.

Access URL: https://www.jstor.org/stable/2631379

A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem

Authors: Martello, Silvano Toth, Paolo

Source: Management Science, 1984 Jun 01. 30(6), 765-771.

Access URL: https://www.jstor.org/stable/2631755