Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

Operations Research- United States

doi 10.1287/opre.41.6.1172

Full Text

Abstract

Available in

Date

Authors

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

An Integer Programming Model for the KenKen Problem

American Journal of Operations Research
2016English

A Mixed Integer Linear Programming Formulation for the Vehicle Routing Problem With Backhauls

International Journal of Industrial Engineering Computations
IndustrialManufacturing Engineering
2019English

Word Sense Disambiguation as an Integer Linear Programming Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Cuts for Mixed 0-1 Conic Programming

Mathematical Programming, Series B
MathematicsSoftware
2005English

An Integer Programming Formulation of the Minimum Common String Partition Problem

PLoS ONE
Multidisciplinary
2015English

Variable Neighbourhood Decomposition Search for 0–1 Mixed Integer Programs

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2010English

A Facet Generation Procedure for Solving 0/1 Integer Programs

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1999Danish

An All-Integer Integer Programming Algorithm

1963Norwegian Bokmål

A Stochastic Mixed Integer Linear Programming Formulation for the Balancing Energy Activation Problem Under Uncertainty

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy