Imagen de Portada

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fravel, Jamie, Hildebrand, Robert
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
por: Fravel, Jamie, et al.
Publicado: (2026)

Continuous Equality Knapsack with Probit-Style Objectives
por: Fravel, Jamie, et al.
Publicado: (2022)

Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
por: Fravel, Jamie, et al.
Publicado: (2023)

Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
por: Hildebrand, Robert, et al.
Publicado: (2024)

Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study
por: King, Brannon, et al.
Publicado: (2024)

Mitigating Dimensionality in 2D Rectangle Packing Problem under Reinforcement Learning Schema
por: Kołodziejczyk, Waldemar, et al.
Publicado: (2024)

Curvature batching gives single-exponential integer quadratic programming
por: Ari, Cinar, et al.
Publicado: (2026)

Optimal triangulations for piecewise linear approximations of non-convex variable products
por: Burlacu, Robert, et al.
Publicado: (2026)

Random-Restart Best-Response Dynamics for Large-Scale Integer Programming Games and Their Applications
por: Lee, Hyunwoo, et al.
Publicado: (2024)

Set System Approximation for Binary Integer Programs: Reformulations and Applications
por: Wei, Ningji
Publicado: (2025)

Joint Binary-Continuous Fractional Programming: Solution Methods and Applications
por: Pham, Hoang Giang, et al.
Publicado: (2022)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. IV. The General Unimodular Two-Dimensional Case
por: Hildebrand, Robert, et al.
Publicado: (2025)

IRON: Implicit Resolvent Optimization under Noise
por: Leplat, Valentin, et al.
Publicado: (2026)

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
por: Pirau, Vitali, et al.
Publicado: (2025)

Learning to Solve Bilevel Programs with Binary Tender
por: Zhou, Bo, et al.
Publicado: (2024)

Application of hybrid classical-quantum annealing technology to the 3D Bin-Packing Problem
por: Rahmani, Mohsen, et al.
Publicado: (2024)

Objective Coefficient Rounding and Almost Symmetries in Binary Programs
por: Kuzinowicz, Dominik, et al.
Publicado: (2025)

Bilevel Mixed-Integer Linear Program with Binary Tender
por: Zhou, Bo, et al.
Publicado: (2025)

Sharp-Peak Functions for Exactly Penalizing Binary Integer Programming
por: Zhou, Shenglong, et al.
Publicado: (2025)

Automated Proof of Polynomial Inequalities via Reinforcement Learning
por: Liu, Banglong, et al.
Publicado: (2025)

Computing Binary Integer Programming via A New Exact Penalty Function
por: Li, Shuai, et al.
Publicado: (2025)

Norm-Constrained Flows and Sign-Based Optimization: Theory and Algorithms
por: Leplat, Valentin, et al.
Publicado: (2025)

Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance
por: Huang, Weimin, et al.
Publicado: (2025)

Discretization-Based Solution Approaches for the Circle Packing Problem
por: Taşpınar, Rabia, et al.
Publicado: (2023)

A first approximation algorithm for the Bin Packing Problem with Setups
por: Baldacci, Roberto, et al.
Publicado: (2025)

Robustifying networks for flow problems against edge failure
por: Klyuchikov, Artyom, et al.
Publicado: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
por: Hou, Di, et al.
Publicado: (2025)

Efficient Gradient-based Optimization for Reconstructing Binary Images in Applications to Electrical Impedance Tomography
por: Arbic II, Paul R., et al.
Publicado: (2023)

Recursive Binary Identification under Data Tampering and Non-Persistent Excitation with Application to Emission Control
por: Guo, Jian, et al.
Publicado: (2025)

Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
por: Fong, Robert Simon, et al.
Publicado: (2024)

Sensitivity Analysis for Binary Outcome Misclassification in Randomization Tests via Integer Programming
por: Heng, Siyu, et al.
Publicado: (2022)

Exact Methods for the Generalized Multiple Strip Packing Problem with Heterogeneous Costs
por: Lee, Hyunwoo, et al.
Publicado: (2026)

ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs
por: Huang, Weimin, et al.
Publicado: (2026)

CFD-based Shape Optimization of Structured Packings for Enhancing Separation Efficiency in Distillation
por: Blauth, Sebastian, et al.
Publicado: (2024)

Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
por: Berthold, Timo, et al.
Publicado: (2026)

On the Linear Programming Model for Dynamic Stochastic Matching and Its Application to Pricing
por: Chen, Junlin, et al.
Publicado: (2025)

A Proof of the Exact Convergence Rate of Gradient Descent
por: Kim, Jungbin
Publicado: (2024)

Second-Order Optimality Conditions for Nonsmooth Constrained Optimization with Applications to Bilevel Programming
por: Liu, Xiang, et al.
Publicado: (2025)

On the Structure of Decision Diagram-Representable Mixed Integer Programs with Application to Unit Commitment
por: Salemi, Hosseinali, et al.
Publicado: (2022)

An Inertial Bregman Proximal DC Algorithm for Generalized DC Programming with Application to Data Completion
por: Pan, Chenjian, et al.
Publicado: (2024)