Výsledky vyhľadávania - "Mixed integer programming formulations"

Strong mixed-integer programming formulations for trained neural networks Autor Anderson, Ross, Huchette, Joey, Ma, Will, Tjandraatmadja, Christian, Vielma, Juan Pablo

“…We present strong mixed-integer programming (MIP) formulations for high-dimensional piecewise linear functions that correspond to trained neural networks…”
Získať plný text

Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems Autor Justkowiak, Jan-Erik, Pesch, Erwin

Získať plný text

Continuous covering on networks: Improved mixed integer programming formulations Autor Pelegrín, Mercedes, Xu, Liding

“…Covering problems are well-studied in the domain of Operations Research, and, more specifically, in Location Science. When the location space is a network, the…”
Získať plný text

Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance Autor Bourguignon, Sebastien, Ninin, Jordan, Carfantan, Herve, Mongeau, Marcel

“…Sparse approximation addresses the problem of approximately fitting a linear model with a solution having as few non-zero components as possible. While most…”
Získať plný text

Compact mixed-integer programming formulations in quadratic optimization Autor Beach, Benjamin, Hildebrand, Robert, Huchette, Joey

“…We present a technique for producing valid dual bounds for nonconvex quadratic optimization problems. The approach leverages an elegant piecewise linear…”
Získať plný text

Mixed integer programming formulations for single machine scheduling problems Autor Keha, Ahmet B., Khowala, Ketan, Fowler, John W.

“…In this paper, the computational performance of four different mixed integer programming (MIP) formulations for various single machine scheduling problems is…”
Získať plný text

Projected mixed integer programming formulations for unit commitment problem Autor Yang, Linfeng, Jian, Jinbao, Wang, Yuanyuan, Dong, Zhaoyang

“…•The semi-continuous variables are eliminated from the UC formulation.•Two tight mixed integer programming formulations of UC problem are obtained…”
Získať plný text

A geometric way to build strong mixed-integer programming formulations Autor Huchette, Joey, Vielma, Juan Pablo

“…We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms…”
Získať plný text

Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations Autor Esmaeilbeigi, Rasul, Charkhgard, Parisa, Charkhgard, Hadi

“… We present two new mixed integer programming formulations for the order acceptance and scheduling problem in two machine flow shops…”
Získať plný text

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations Autor Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kleinert, Thomas

“…Bilinear terms naturally appear in many optimization problems. Their inherent non-convexity typically makes them challenging to solve. One approach to tackle…”
Získať plný text

Order acceptance and scheduling on non-identical parallel machines with dependent setup times: new mixed integer programming formulations Autor Jos, Bobin Cherian, Rajendran, Chandrasekharan, Srinivas, Sharan

Získať plný text

Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems Autor Unlu, Yasin, Mason, Scott J.

“…Mixed integer programming (MIP) formulations for scheduling problems can be classified based on the decision variables upon which they rely. In this paper,…”
Získať plný text

Mixed integer programming formulations for the generalized traveling salesman problem with time windows Autor Yuan, Yuan, Cattaruzza, Diego, Ogier, Maxime, Rousselot, Cyriaque, Semet, Frédéric

“…The generalized traveling salesman problem with time windows (GTSPTW) is defined on a directed graph where the vertex set is partitioned into clusters. One…”
Získať plný text

A comparison of mixed integer programming formulations of the capacitated lot-sizing problem Autor Karagul, Hakan F., Warsing, Donald P., Hodgson, Thom J., Kapadia, Maaz S., Uzsoy, Reha

“…We propose a novel mixed integer programming formulation for the capacitated lot-sizing problem with set-up times and set-up carryover…”
Získať plný text

Mixed integer programming formulations for clustering problems related to structural balance Autor Figueiredo, Rosa, Moura, Gisele

“…•We define and formalize graph clustering problems associated with structural balance.•We prove worst-case complexity of a problem (RCC) introduced by Durian…”
Získať plný text

Mixed integer programming formulations for the Biomass Truck Scheduling problem Autor Torjai, László, Kruzslicz, Ferenc

“…In this paper, we introduce the Biomass Truck Scheduling (BTS) problem that originated in a real-life herbaceous biomass supply chain (HBSC) around Pécs,…”
Získať plný text

Mixed Integer Programming Formulations for Steiner Tree and Quality of Service Multicast Tree Problems Autor Risso, C., Robledo, F., Nesmachnow, S.

“…This article presents flow-based mixed integer programming formulations for the Steiner Tree Problem and its variant applied to model and solve the Quality of Service Multicast Tree problem…”
Získať plný text

Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint Autor Xu, Zhijun, Xu, Dehua, He, Jie, Wang, Qi, Liu, Aihua, Xiao, Junfang

“… Seven mixed integer programming formulations (MIPFs) are proposed for the problem where the availability constraint is imposed on the first machine…”
Získať plný text

Mixed Integer Programming Formulations for Single Row Facility Layout Problems with Asymmetric Material Flow and Corridor Width Autor Yang, Xuhong, Cheng, Wenming, Guo, Peng, He, Qiaoting

“…In both the research and industry studies, mixed integer programming (MIP) is often the default method for solving facility layout problems. While MIP models…”
Získať plný text

Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems Autor Ying, Kuo-Ching, Cheng, Chen-Yang, Lin, Shih-Wei, Hung, Chia-Yang

“…This study evaluates various Mixed Integer Programming (MIP) formulations for solving single-machine and parallel-machine scheduling problems, with the…”
Získať plný text