Suchergebnisse - cutting plane/branch and bound algorithm

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing von Nemhauser, G. L., Sigismondi, G.

“… We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities …”
Volltext

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing von Nemhauser, G. L., Sigismondi, G.

Volltext

A cutting plane algorithm for a single machine scheduling problem von Soric, Kristina

“… Each of N part types (production families or items) is to be processed on a single machine. The part types arrive into the buffer in front of the machine at …”
Volltext

The Capacitated m-Ring-Star Problem von Baldacci, R, Dell'Amico, M, Gonzalez, J. Salazar

“… The Capacitated m -Ring-Star Problem (C m RSP) is the problem of designing a set of rings that pass through a central depot and through some transition points …”
Volltext

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation von Baldacci, R, Hadjiconstantinou, E, Mingozzi, A

“… We present a lower bound derived from the linear programming (LP) relaxation of the new formulation which is improved by adding valid inequalities in a cutting-plane fashion …”
Volltext

Set Partitioning: A Survey von Balas, Egon, Padberg, Manfred W.

“… This paper discusses the set partitioning or equality-constrained set covering problem. It is a survey of theoretical results and solution methods for this …”
Volltext

Estimation of the number of iterations in integer programming algorithms using the regular partitions method von Kolokolov, A. A., Zaozerskaya, L. A.

“… We present such estimates for some cutting plane, branch and bound (Land and Doig scheme), and L -class enumeration algorithms and consider questions of their stability …”
Volltext

An implementation of exact knapsack separation von Vasilyev, Igor, Boccia, Maurizio, Hanafi, Saïd

“… In recent decades, many contributions have led to successive improvements in branch-and-cut methods which incorporate cutting planes in branch and bound algorithm …”
Volltext

Optimal multicast route packing von Kang, Jangha, Park, Kyungchul, Park, Sungsoo

“… with the objective of minimizing the cost. For the problem, we propose a branch-and-cut-and-price algorithm, which can be viewed as a branch-and-bound method incorporating both the strong cutting plane algorithm and the column generation method …”
Volltext

DCA for solving the scheduling of lifting vehicle in an automated port container terminal von Le, Hoai Minh, Yassine, Adnan, Moussi, Riadh

“… The container was introduced as a universal carrier for various goods in the 1960s and soon became a standard worldwide transportation. The competitiveness of …”
Volltext

PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI von SURYAWAN, GEDE, TASTRAWATI, NI KETUT TARI, SARI, KARTIKA

“… Programming’s problems other than Cutting Plane method. Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value …”
Volltext

MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles von de Andrade, Rafael Castro, Saraiva, Rommel Dias

“… . We propose three exact solution approaches for SPNC, including a compact primal-dual model, a combinatorial branch-and-bound algorithm, and a cutting-plane method …”
Volltext

Maximizing a submodular function by integer programming: A polyhedral approach von Lee, Heesang

“… Let N = $\{$1,2, ...,n$\}$ be a finite set. A set function f is submodular if f(S) + f(T) $\geq$ f(S $\cup$ T) + f(S $\cap$ T) for all S, T $\subseteq$ N. The …”
Volltext

An exact semidefinite programming approach for the max-mean dispersion problem von Garraffa, Michele, Della Croce, Federico, Salassa, Fabio

“… The proposed approach embeds the SDP relaxation and the cutting plane algorithm into a branch and bound framework to solve M a x - M e a n D P instances to optimality …”
Volltext

Lagrangian duality applied to the vehicle routing problem with time windows von Kallehauge, Brian, Larsen, Jesper, Madsen, Oli B.G.

“… We have embedded the stabilized cutting-plane algorithm in a branch-and-bound search and introduce strong …”
Volltext

An Approach of Epistasis Detection Using Integer Linear Programming Optimizing Bayesian Network von Yang, Xuan, Yang, Chen, Lei, Jimeng, Liu, Jianxiao

“… ). We use the algorithms of branch-and-bound and cutting planes to get the global optimal Bayesian network …”
Volltext

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach von Bouras, Ikram, Figueiredo, Rosa, Poss, Michael, Zhou, Fen

“… In recent years, green networking has attracted a lot of attention from device manufacturers and Internet Service Providers (ISP) to reduce energy consumption …”
Volltext

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs von Magnanti, T. L, Vachani, R

“… Changeover costs (and times) are central to numerous manufacturing operations. These costs arise whenever work centers capable of processing only one product …”
Volltext

Retrospective on optimization von Biegler, Lorenz T., Grossmann, Ignacio E.

“… In this paper, we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which …”
Volltext

On the Complexity of Selecting Disjunctions in Integer Programming von Mahajan, Ashutosh, Ralphs, Ted

“… The imposition of general disjunctions of the form " ... ," where ... are integer-valued, is a fundamental operation in both the branch-and-bound and cutting-plane algorithms for solving mixed integer linear programs …”
Volltext