Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
24 | Chee Fen Yu, Benjamin W. Wah |
Learning Dominance Relations in Combinatorial Search Problems. |
IEEE Trans. Software Eng. |
1988 |
DBLP DOI BibTeX RDF |
combined search problems, search graphs, 0/1-knapsack problem, inventory problem, reliability-by-replication, two-machine flow shop problem, two-machine scheduling, scheduling, machine learning, artificial intelligence, artificial intelligence, optimisation, optimisation, learning systems, single-machine scheduling, combinatorial mathematics, dominance relations |
24 | Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello |
Knapsack problems - An overview of recent advances. Part I: Single knapsack problems. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Valentina Cacchiani, Manuel Iori, Alberto Locatelli, Silvano Martello |
Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Hazem A. A. Nomer, Khalid Abdulaziz Alnowibet, Ashraf Elsayed, Ali Wagdy Mohamed |
Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem. |
IEEE Access |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Adam N. Letchford, Georgia Souli |
Lifting the knapsack cover inequalities for the knapsack polytope. |
Oper. Res. Lett. |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Britta Schulze, Michael Stiglmayr, Luís Paquete, Carlos M. Fonseca, David Willems, Stefan Ruzika |
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. |
Math. Methods Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Konstantinos A. Draziotis, Anastasia Papadopoulou |
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme. |
Adv. Math. Commun. |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Thekra Aldouri |
Heuristic methods for solving knapsack type problems. (Méthodes heuristiques pour les problèmes de type knapsack). |
|
2018 |
RDF |
|
24 | Peter Jacko |
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. |
Ann. Oper. Res. |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Jing Liu, Zhixiang Yin |
Based on DNA Self-Assembled Computing to Solve MH Knapsack Public Key Cryptosystems of the Knapsack Problem. |
BIC-TA |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Marcel Büther, Dirk Briskorn |
Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem. |
Int. J. Oper. Res. Inf. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Thomas C. Sharkey, H. Edwin Romeijn, Joseph Geunes |
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Zhu Nan |
A Relation Between the Knapsack, Group Knapsack Problems. |
Discret. Appl. Math. |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Dominique Quadri, Éric Soutif, Pierre Tolla |
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
Separable quadratic function, Surrogate relaxation, Integer programming, Branch-and-bound, Linearization |
21 | Saïd Hanafi, Raïd Mansi, Christophe Wilbaut |
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. |
Hybrid Metaheuristics |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Baocang Wang, Hui Liu, Yupu Hu |
Cryptanalysis of a Knapsack Public Key Cryptosystem. |
IAS |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Philipp Rohlfshagen, Xin Yao 0001 |
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation. |
EvoWorkshops |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sima Uyar, H. Turgut Uyar |
A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation. |
EvoWorkshops |
2009 |
DBLP DOI BibTeX RDF |
dynamic problem generators, constrained problems, change severity, evolutionary algorithms, Dynamic environments |
21 | Dang Minh Quan, Laurence Tianruo Yang |
Solving 0/1 Knapsack Problem for Light Communication SLA-Based Workflow Mapping Using CUDA. |
CSE (1) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sien-Tang Tsai |
Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem. |
ICA3PP |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Hamid Shojaei, Amir Hossein Ghamarian, Twan Basten, Marc Geilen, Sander Stuijk, Rob Hoes |
A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management. |
DAC |
2009 |
DBLP DOI BibTeX RDF |
CMP run-time management, MMKP, Pareto algebra |
21 | Jorge Tavares, Francisco Baptista Pereira, Ernesto Costa |
Multidimensional Knapsack Problem: A Fitness Landscape Analysis. |
IEEE Trans. Syst. Man Cybern. Part B |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Krzysztof C. Kiwiel |
Breakpoint searching algorithms for the continuous quadratic knapsack problem. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 65K05, 90C25 |
21 | Daniel H. Leventhal, Meinolf Sellmann |
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. |
CPAIOR |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Alex S. Fukunaga |
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver. |
CPAIOR |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Gilles Pesant, Claude-Guy Quimper |
Counting Solutions of Knapsack Constraints. |
CPAIOR |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Pedro Gómez-Meneses, Marcus Randall |
Extremal Optimisation with a Penalty Approach for the Multidimensional Knapsack Problem. |
SEAL |
2008 |
DBLP DOI BibTeX RDF |
|
21 | José Luis Montaña, César Luis Alonso, Stefano Cagnoni, Mar Callau |
Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies. |
EvoWorkshops |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Changshou Deng, Bingyan Zhao, An-Yuan Deng, Chang-Yong Liang |
Hybrid-Coding Binary Differential Evolution Algorithm with Application to 0-1 Knapsack Problems. |
CSSE (1) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve |
Length-Lex Bounds Consistency for Knapsack Constraints. |
CP |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Ole-Christoffer Granmo, B. John Oommen, Svein Arild Myrer, Morten Goodwin Olsen |
Learning Automata-Based Solutions to the Nonlinear Fractional Knapsack Problem With Applications to Optimal Resource Allocation. |
IEEE Trans. Syst. Man Cybern. Part B |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Tzung-Pei Hong, Wen-Yang Lin, Shu-Min Liu, Jiann-Horng Lin |
Experimental analysis of dynamic migration intervals on 0/1 knapsack problems. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Fernanda Hembecker, Heitor S. Lopes, Walter Godoy Jr. |
Particle Swarm Optimization for the Multidimensional Knapsack Problem. |
ICANNGA (1) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger |
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. |
EvoCOP |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Junzhong Ji, Zhen Huang, Chunnian Liu, Xuejing Liu, Ning Zhong 0001 |
An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems. |
IAT |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sergey Polyakovsky, Rym M'Hallah |
An Agent-Based Approach to Knapsack Optimization Problems. |
IEA/AIE |
2007 |
DBLP DOI BibTeX RDF |
artificial intelligence, heuristics, agent-based systems |
21 | Moussa Elkihel, Didier El Baz |
Load Balancing in a Parallel Dynamic Programming Multi-Method Applied to the 0-1 Knapsack Problem. |
PDP |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Daniel Lichtblau |
Making Change and Finding Repfigits: Balancing a Knapsack. |
ICMS |
2006 |
DBLP DOI BibTeX RDF |
Frobenius instance solving, change-making problem, Frobenius numbers, Keith numbers, repfigits, integer linear programming, lattice reduction |
21 | Rolf Harren |
Approximating the Orthogonal Knapsack Problem for Hypercubes. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Min Kong, Peng Tian |
Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem. |
ICAISC |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Bin Zhang 0006, Zhongsheng Hua |
Heuristics to Convex Quadratic Knapsack Problems in Sorted ADP. |
ICIC (1) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Hong Li 0007, Yong-Chang Jiao, Li Zhang 0051, Ze-Wei Gu |
Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems. |
ICNC (1) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Michael Benisch, James Andrews, Norman M. Sadeh |
Pricing for customers with probabilistic valuations as a continuous knapsack problem. |
ICEC |
2006 |
DBLP DOI BibTeX RDF |
multi-agent systems, supply chain management, trading agents, TAC SCM |
21 | Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy |
The Core Concept for the Multidimensional Knapsack Problem. |
EvoCOP |
2006 |
DBLP DOI BibTeX RDF |
|
21 | A. Sermet Anagun, T. Sarac |
Optimization of Performance of Genetic Algorithm for 0-1 Knapsack Problems Using Taguchi Method. |
ICCSA (3) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren |
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
21 | José E. Gallardo, Carlos Cotta, Antonio J. Fernández 0001 |
Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound. |
IWINAC (2) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Wided Ouaja, Barry Richards |
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
integer multicommodity flow problems, network routing, constraint propagation, lagrangian relaxation |
21 | Gualtiero Colombo 0001, Christine L. Mumford |
Comparing algorithms, representations and operators for the multi-objective knapsack problem. |
Congress on Evolutionary Computation |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Yan Wang 0028, Xiaoyue Feng, Yanxin Huang, Wengang Zhou, Yanchun Liang 0001, Chunguang Zhou |
A Novel Quantum Swarm Evolutionary Algorithm for Solving 0-1 Knapsack Problem. |
ICNC (2) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Robert Cleary, Michael O'Neill 0001 |
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem. |
EvoCOP |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Hisao Ishibuchi, Kaname Narukawa |
Spatial Implementation of Evolutionary Multiobjective Algorithms with Partial Lamarckian Repair for Multiobjective Knapsack Problems. |
HIS |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Hisao Ishibuchi, Shiori Kaige, Kaname Narukawa |
Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems. |
EMO |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Wenping Ma 0001, Licheng Jiao, Maoguo Gong, Fang Liu 0001 |
An Novel Artificial Immune Systems Multi-objective Optimization Algorithm for 0/1 Knapsack Problems. |
CIS (1) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Subhash C. Sarin, Yuqiang Wang, Dae B. Chang |
A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
21 | XiuPing Guo, Zhiming Wu, GenKe Yang |
A Hybrid Adaptive Multi-objective Memetic Algorithm for 0/1 Knapsack Problem. |
Australian Conference on Artificial Intelligence |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Hui Li 0020, Qingfu Zhang 0001, Edward P. K. Tsang, John A. Ford |
Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem. |
EvoCOP |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Mihai Oltean, Crina Grosan, Mihaela Oltean |
Designing Digital Circuits for the Knapsack Problem. |
International Conference on Computational Science |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Stefka Fidanova |
Ant Colony Optimization for Multiple Knapsack Problem and Model Bias. |
NAA |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Dalessandro Soares Vianna, José Elias Claudio Arroyo |
A GRASP Algorithm for the Multi-Objective Knapsack Problem. |
SCCC |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Terence Kelly |
Combinatorial Auctions and Knapsack Problems. |
AAMAS |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Julián Aráoz, Lisa Evans, Ralph E. Gomory, Ellis L. Johnson |
Cyclic group and knapsack facets. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Stefka Fidanova |
Monte Carlo Method for Multiple Knapsack Problem. |
LSSC |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Maria A. Osorio, Fred W. Glover |
Exploiting Surrogate Constraint Analysis for Fixing Variables in both bounds for Multidimensional Knapsack Problems. |
ENC |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Andrés Cordón-Franco, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Fernando Sancho-Caparrini |
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem. |
Workshop on Membrane Computing |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Mario J. Pérez-Jiménez, Agustin Riscos-Núñez |
A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes. |
Workshop on Membrane Computing |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Robert C. Holte |
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search. |
AI |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Mario J. Pérez-Jiménez, Fernando Sancho-Caparrini |
Solving Knapsack Problems in a Sticker Based Model. |
DNA |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Monaldo Mastrolilli |
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Jens Levenhagen, Andreas Bortfeldt, Hermann Gehring |
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem. |
EvoWorkshops |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Jens Gottlieb |
On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems. |
EvoWorkshops |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Pierre Chardaire, Geoff P. McKeown, Jameel A. Maki |
Application of GRASP to the Multiconstraint Knapsack Problem. |
EvoWorkshops |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Thierry Benoist, Eric Bourreau, Yves Caseau, Benoît Rottembourg |
Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines. |
CP |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Shiuh-Jeng Wang, Jin-Fu Chang |
A Conference Key Multicasting Scheme Using Knapsack and Secret Sharing. |
DEXA |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Hans Kellerer, Ulrich Pferschy |
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Zbigniew Michalewicz, Jaroslaw Arabas |
Genetic Algorithms for the 0/1 Knapsack Problem. |
ISMIS |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Paul Camion, Jacques Patarin |
The Knapsack Hash Function proposed at Crypto'89 can be broken. |
EUROCRYPT |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Alberto Marchetti-Spaccamela, Carlo Vercellis |
Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract). |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
18 | Shaddin Dughmi, Arpita Ghosh |
Truthful assignment without money. |
EC |
2010 |
DBLP DOI BibTeX RDF |
truthfulness without money, mechanism design |
18 | Daniel Lokshtanov, Jesper Nederlof |
Saving space by algebraization. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
moebius, dynamic programming, space efficient, fourier |
18 | Brian Dougherty, Jules White, Chris Thompson, Douglas C. Schmidt |
Automating Hardware and Software Evolution Analysis. |
ECBS |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia |
Private Information: To Reveal or not to Reveal. |
ACM Trans. Inf. Syst. Secur. |
2008 |
DBLP DOI BibTeX RDF |
authorization, policies, secure multi-party computation |
18 | Jong-Pil Yoon, Woo-Jae Kim, Joo-Young Baek, Young-Joo Suh |
Efficient Uplink Resource Allocation for Power Saving in IEEE 802.16 OFDMA Systems. |
VTC Spring |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Quentin Louveaux, Laurence A. Wolsey |
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Mixed integer rounding, Single node flow sets, Lifting |
18 | Wolfgang W. Bein, José R. Correa, Xin Han |
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Anna Urbanska |
Faster Combinatorial Algorithms for Determinant and Pfaffian. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
Pfaffian, Algorithm, Graph, Determinant, Matrix |
18 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
On a Generalization of the Master Cyclic Group Polyhedron. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
integer programming, polyhedral combinatorics |
18 | Markus Behle |
On Threshold BDDs and the Optimal Variable Ordering Problem. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Yangyang Li 0001, Licheng Jiao |
Quantum-Inspired Immune Clonal Multiobjective Optimization Algorithm. |
PAKDD |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Ole-Christoffer Granmo, B. John Oommen |
On Using a Hierarchy of Twofold Resource Allocation Automata to Solve Stochastic Nonlinear Resource Allocation Problems. |
Australian Conference on Artificial Intelligence |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Takashi Horiyama, Kazuo Iwama, Jun Kawahara |
Finite-State Online Algorithms and Their Automated Competitive Analysis. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Chris Peikert, Alon Rosen |
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Brian C. Dean, Michel X. Goemans, Jan Vondrák |
Adaptivity and approximation for stochastic packing problems. |
SODA |
2005 |
DBLP BibTeX RDF |
|
18 | Rajeev Kumar 0004, Nilanjan Banerjee |
Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems. |
FOGA |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Patrick Briest, Piotr Krysta, Berthold Vöcking |
Approximation techniques for utilitarian mechanism design. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method |
18 | Leonid Meyerguz, David Kempe 0001, Jon M. Kleinberg, Ron Elber |
The evolutionary capacity of protein structures. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
evolutionary networks, rapidly mixing Markov chains, protein structure, approximate counting |
18 | He Zhang, Xiu Li 0001, Wenhuang Liu |
A Method of Network Simplification in a 4PL System. |
CSCWD (Selected papers) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Quentin Louveaux, Laurence A. Wolsey |
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. |
4OR |
2003 |
DBLP DOI BibTeX RDF |
mixed integer rounding, single node flow sets, Lifting |
18 | Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser |
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. |
IPCO |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
Exponential Lower Bound for Static Semi-algebraic Proofs. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|