Cover Image

An Integer Linear Programming Model for the Evolomino Puzzle

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nikolaev, Andrei V., Myasnikov, Yuri A.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Combinatorics 90C10, 90C27, 90C90, 00A08, 05B50
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
by: Affar, Samuel, et al.
Published: (2024)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

A Successive Refinement for Solving Stochastic Programs with Decision-Dependent Random Capacities
by: Medal, Hugh, et al.
Published: (2024)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

Sailing League Problems
by: Schüler, Robert, et al.
Published: (2022)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)

Linear Programming for Multi-Criteria Assessment with Cardinal and Ordinal Data: A Pessimistic Virtual Gap Analysis
by: Liu, Fuh-Hwa Franklin, et al.
Published: (2026)

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

Deriving Priorities From Inconsistent PCM using the Network Algorithms
by: Anholcer, Marcin, et al.
Published: (2015)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Virtual Gap Analysis procedures for Multi-Criteria Decision-Making and Efficiency Analysis Problems
by: Liu, Fuh-Hwa Franklin, et al.
Published: (2026)

Algorithms for Multi-Criteria Decision-Making and Efficiency Analysis Problems
by: Liu, Fuh-Hwa Franklin, et al.
Published: (2024)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

A Decision-Making Method in Polyhedral Convex Set Optimization
by: Löhne, Andreas
Published: (2024)

Thresholds of Queen covers
by: Adhikari, Tirthankar, et al.
Published: (2025)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

The rainbow covering number of clean tangled clutters
by: Abdi, Ahmad, et al.
Published: (2025)

A simple iterative algorithm for maxcut
by: Shao, Sihong, et al.
Published: (2018)

Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)

Fixed Topology Minimum-Length Trees with Neighborhoods
by: Blanco, Víctor, et al.
Published: (2024)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
by: Peiris, Vinesha, et al.
Published: (2026)

A simple inverse power method for balanced graph cut
by: Shao, Sihong, et al.
Published: (2024)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)

Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients
by: Müller, Johannes, et al.
Published: (2024)